



def 				A			(		__UpperCAmelCase	)       ->       list:



						'''simple docstring'''






						if len(__UpperCAmelCase	) <= 1:
												return data
						else:
												return [
												    *quick_sort([e for e in data[1:] if e <= data[0]]	),
												    data[0],
												    *quick_sort([e for e in data[1:] if e > data[0]]	),
												]


if __name__ == "__main__":
							import doctest

							doctest.testmod()












import math




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




def        lowerCAmelCase_       (							UpperCamelCase_ = 600851475143     )   ->						int:

       try:
              UpperCamelCase_      				=     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."     )
       UpperCamelCase_      				=     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     ):
                            UpperCamelCase_      				=     n // i
                            break
                     elif is_prime(UpperCamelCase_     ):
                            UpperCamelCase_      				=     i
       return max_number


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

