"""simple docstring"""

__lowercase    =				'''\n# Transformers installation\n! pip install transformers datasets evaluate\n# To install from source instead of the last release, comment the command above and uncomment the following one.\n# ! pip install git+https://github.com/huggingface/transformers.git\n'''

__lowercase    =				[{'''type''': '''code''', '''content''': INSTALL_CONTENT}]
__lowercase    =				{
    '''{processor_class}''': '''FakeProcessorClass''',
    '''{model_class}''': '''FakeModelClass''',
    '''{object_class}''': '''FakeObjectClass''',
}





"""simple docstring"""






import math
def    UpperCamelCase						(					UpperCAmelCase     )						->bool:

   """simple docstring"""



   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(UpperCAmelCase     ) + 1     ) ,   6     ):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True
def    UpperCamelCase						(					UpperCAmelCase = 600_851_475_143     )						->int:

   """simple docstring"""



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


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