






import math






def    UpperCAmelCase__	(						lowerCamelCase  : Tuple						):







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






def    UpperCAmelCase__	(						lowerCamelCase  : Any = 10_00 ,lowerCamelCase  : Tuple = 10_00						):
   lowerCamelCase											=[0, 0, 0]  # length, a, b
   for a in range((a_limit * -1) + 1 ,lowercase__						):
      for b in range(2 ,lowercase__						):
         if is_prime(lowercase__						):
            lowerCamelCase											=0
            lowerCamelCase											=0
            while is_prime((n**2) + (a * n) + b						):
               count += 1
               n += 1
            if count > longest[0]:
               lowerCamelCase											=[count, a, b]
   lowerCamelCase											=longest[1] * longest[2]
   return ans


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







import random






def    UpperCAmelCase__	(						lowerCamelCase  : Optional[Any]						):

   def is_sorted(lowerCamelCase  : Any						):
      for i in range(len(lowerCamelCase						) - 1						):
         if collection[i] > collection[i + 1]:
            return False
      return True

   while not is_sorted(lowerCamelCase						):
      random.shuffle(lowerCamelCase						)
   return collection


if __name__ == "__main__":
   _UpperCAmelCase				:	Any    						=    input('Enter numbers separated by a comma:\n').strip()
   _UpperCAmelCase				:	Optional[Any]    						=    [int(item) for item in user_input.split(',')]
   print(bogo_sort(unsorted))