




import math





def 	__A	(			__lowerCamelCase					)   -> bool:

 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(__lowerCamelCase					) + 1					)							,    6					):
  if number % i == 0 or number % (i + 2) == 0:
   return False
 return True





def 	__A	(			__lowerCamelCase = 6008_5147_5143					)   -> int:

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


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







import doctest

import projectq
from projectq.ops import H, Measure





def 	__A	(			__lowerCamelCase					)   -> int:
	a		       =							quantum_engine.allocate_qubit()
	H | qubit
	Measure | qubit
	return int(__lowerCamelCase					)


if __name__ == "__main__":
		doctest.testmod()

		# initialises a new quantum backend
		__UpperCamelCase      : List[Any]					      =   projectq.MainEngine()

		# Generate a list of 10 random numbers
		__UpperCamelCase      : Optional[int]					      =   [get_random_number(quantum_engine) for _ in range(10)]

		# Flushes the quantum engine from memory
		quantum_engine.flush()

		print("Random numbers", random_numbers_list)

