



"""simple docstring"""






def 	snake_case__  (						__lowerCamelCase							:       int = 20      ):
			"""simple docstring"""

			try:
						lowerCamelCase__						:						Tuple						      =int(__lowerCamelCase      )
			except (TypeError, ValueError):
						raise TypeError('''Parameter n must be int or castable to int.'''      )
			if n <= 0:
						raise ValueError('''Parameter n must be greater than or equal to one.'''      )
			lowerCamelCase__						:						Union[str, Any]						      =0
			while 1:
						i += n * (n - 1)
						lowerCamelCase__						:						Dict						      =0
						for j in range(2				,						__lowerCamelCase      ):
									if i % j != 0:
												lowerCamelCase__						:						Union[str, Any]						      =1
												break
						if nfound == 0:
									if i == 0:
												lowerCamelCase__						:						List[str]						      =1
									return i
			return None


if __name__ == "__main__":
		print(f'{solution() = }')












def      UpperCAmelCase						( lowerCAmelCase__					,     lowerCAmelCase__	):


		'''simple docstring'''

		if n < 0:
				return 0
		# table[i] represents the number of ways to get to amount i
		__A    =							[0] * (n + 1)

		# There is exactly 1 way to get to zero(You pick no coins).
		__A    =							1

		# Pick all coins one by one and update table[] values
		# after the index greater than or equal to the value of the
		# picked coin
		for coin_val in s:
				for j in range(lowerCAmelCase__					,     n + 1	):
						table[j] += table[j - coin_val]

		return table[n]


if __name__ == "__main__":
					import doctest

					doctest.testmod()

