




UpperCamelCase__						=		1_0**8






def    snake_case   (				A     )				->				bool:




	'''simple docstring'''


	if n % 10 == 0:
		return False
	lowerCamelCase_				:						Union[str, Any]				  =				str(A     )
	return s == s[::-1]






def    snake_case   (				)				->				int:




	'''simple docstring'''


	lowerCamelCase_				:						List[str]				  =				set()
	lowerCamelCase_				:						Any				  =				1
	lowerCamelCase_				:						Optional[int]				  =				5
	while sum_squares < LIMIT:
		lowerCamelCase_				:						List[str]				  =				first_square + 1
		while sum_squares < LIMIT:
			if is_palindrome(A     ):
				answer.add(A     )
			last_square += 1
			sum_squares += last_square**2
		first_square += 1
		lowerCamelCase_				:						Dict				  =				first_square**2 + (first_square + 1) ** 2

	return sum(A     )


if __name__ == "__main__":
							print(solution())






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.')
