




def 							_A       (						lowerCAmelCase_					: int = 200      ):
     """simple docstring"""

     lowerCAmelCase__          =			[1, 2, 5, 10, 20, 50, 100, 200]
     lowerCAmelCase__          =			[0] * (pence + 1)
     lowerCAmelCase__          =			1  # base case: 1 way to make 0 pence

     for coin in coins:
          for i in range(lowerCAmelCase_       ,    pence + 1       ,    1      ):
               number_of_ways[i] += number_of_ways[i - coin]
     return number_of_ways[pence]


if __name__ == "__main__":
     assert solution(200) == 7_3682






import string



def 							_A       (						lowerCAmelCase_					: str      ):
     """simple docstring"""

     for key in range(len(string.ascii_uppercase      )      ):
          lowerCAmelCase__          =			""
          for symbol in message:
               if symbol in string.ascii_uppercase:
                    lowerCAmelCase__          =			string.ascii_uppercase.find(lowerCAmelCase_      )
                    lowerCAmelCase__          =			num - key
                    if num < 0:
                         lowerCAmelCase__          =			num + len(string.ascii_uppercase      )
                    lowerCAmelCase__          =			translated + string.ascii_uppercase[num]
               else:
                    lowerCAmelCase__          =			translated + symbol
          print(F'Decryption using Key #{key}: {translated}'      )



def 							_A       (						):
     """simple docstring"""

     lowerCAmelCase__          =			input("Encrypted message: "      )
     lowerCAmelCase__          =			message.upper()
     decrypt(lowerCAmelCase_      )


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     main()
