




def    snake_case   (				A		,  A     )				->				Tuple:




	'''simple docstring'''


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

	# There is exactly 1 way to get to zero(You pick no coins).
	lowerCamelCase_				:						Optional[int]				  =				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(A		,  n + 1     ):
			table[j] += table[j - coin_val]

	return table[n]


if __name__ == "__main__":
							import doctest

							doctest.testmod()






def    snake_case   (				A		,  A     )				->				int:




	'''simple docstring'''


	if a < b:
		return gcd(A		,  A     )
	if a % b == 0:
		return b
	return gcd(A		,  a % b     )






def    snake_case   (				A		,  A		,  A     )				->				int:




	'''simple docstring'''


	if y == 0:
		return 1
	lowerCamelCase_				:						int				  =				power(A		,  y // 2		,  A     ) % mod
	lowerCamelCase_				:						List[Any]				  =				(temp * temp) % mod
	if y % 2 == 1:
		lowerCamelCase_				:						str				  =				(temp * x) % mod
	return temp






def    snake_case   (				A     )				->				bool:




	'''simple docstring'''


	lowerCamelCase_				:						Union[str, Any]				  =				2
	while b < n:
		if gcd(A		,  A     ) == 1 and power(A		,  n - 1		,  A     ) != 1:
			return False
		b += 1
	return True


if __name__ == "__main__":
							UpperCamelCase__						=		int(input('Enter number: ').strip())
							if is_carmichael_number(number):
														print(F'{number} is a Carmichael Number.')
							else:
														print(F'{number} is not a Carmichael Number.')
