






"""simple docstring"""




import math





def 						__UpperCAmelCase      (					a_):

							if 1 < number < 4:
														# 2 and 3 are primes
														return True
							elif number < 2 or number % 2 == 0 or number % 3 == 0:
														# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
														return False

							# All primes number are in format of 6k +/- 1
							for i in range(5							,					int(math.sqrt(a_) + 1)							,					6):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True





def 						__UpperCAmelCase      (					a_ = 60_08_51_47_51_43):

							try:
														snake_case_           =							int(a_)
							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.')
							snake_case_           =							0
							if is_prime(a_):
														return n
							while n % 2 == 0:
														n //= 2
							if is_prime(a_):
														return n
							for i in range(3							,					int(math.sqrt(a_)) + 1							,					2):
														if n % i == 0:
																					if is_prime(n // i):
																												snake_case_           =							n // i
																												break
																					elif is_prime(a_):
																												snake_case_           =							i
							return max_number


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













def 						__UpperCAmelCase      (					a_):
							return 1 if input_a == 0 else 0





def 						__UpperCAmelCase      (					):
							assert not_gate(0) == 1
							assert not_gate(1) == 0


if __name__ == "__main__":
	print(not_gate(0))
	print(not_gate(1))





