



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



def  _lowerCAmelCase     (_lowerCAmelCase ,						_lowerCAmelCase ,						_lowerCAmelCase):
					if y == 0:
										return 1
					UpperCamelCase_			= power(_lowerCAmelCase ,						y // 2 ,						_lowerCAmelCase) % mod
					UpperCamelCase_			= (temp * temp) % mod
					if y % 2 == 1:
										UpperCamelCase_			= (temp * x) % mod
					return temp



def  _lowerCAmelCase     (_lowerCAmelCase):
					UpperCamelCase_			= 2
					while b < n:
										if gcd(_lowerCAmelCase ,						_lowerCAmelCase) == 1 and power(_lowerCAmelCase ,						n - 1 ,						_lowerCAmelCase) != 1:
															return False
										b += 1
					return True


if __name__ == "__main__":
	UpperCAmelCase :				Tuple							=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.")

def 					UpperCamelCase__		(							A__ = 400_0000       )  ->   int:

				if n <= 1:
								return 0
				snake_case__   :      Optional[Any]   				= 0
				snake_case__   :      Optional[int]   				= 2
				snake_case__   :      str   				= 0
				while 4 * b + a <= n:
								snake_case__				,    snake_case__   :      Optional[Any]   				= b, 4 * b + a
								count += a
				return count + b


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


