



def 			UpperCamelCase(  __UpperCamelCase							:		int = 200 ):
		lowerCAmelCase_			:     Optional[int]									= [1, 2, 5, 10, 20, 50, 100, 200]
		lowerCAmelCase_			:     Union[str, Any]									= [0] * (pence + 1)
		lowerCAmelCase_			:     int									= 1  # base case: 1 way to make 0 pence

		for coin in coins:
				for i in range(__UpperCamelCase     ,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













from maths.prime_check import is_prime
def 					snake_case_						(   lowerCAmelCase_				:  int					):
							if not isinstance(lowerCAmelCase_				,				lowerCAmelCase_					):
														__lowercase					:							Dict			=   F"Input value of [number={number}] must be an integer"
														raise TypeError(lowerCAmelCase_					)
							if is_prime(lowerCAmelCase_					) and is_prime(number + 2					):
														return number + 2
							else:
														return -1


if __name__ == "__main__":
	import doctest

	doctest.testmod()