




import math

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

def 	lowerCAmelCase_	(     lowerCamelCase:				int = 10_00   , lowerCamelCase:				int = 10_00  )    ->	int:


      '''simple docstring'''




      lowerCamelCase__					     = [0, 0, 0]  # length, a, b
      for a in range((a_limit * -1) + 1   , lowerCamelCase  ):
            for b in range(2   , lowerCamelCase  ):
                  if is_prime(lowerCamelCase  ):
                        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(1_000, 1_000))

def 				A__    (  lowerCamelCase  )     ->		Optional[Any]:
				UpperCamelCase_:							Optional[int]		=  len(lowerCamelCase  )
				for _ in range(
				    0   ,			int(((no_of_elements - 1) / 2) + 1  )  ):  # we don't need to traverse to end of list as
								for j in range(0   ,			no_of_elements - 1  ):
												if (
												    lst[j + 1] < lst[j]
												):  # applying bubble sort algorithm from left to right (or forwards)
																UpperCamelCase_:							str		=  lst[j + 1]
																UpperCamelCase_:							Tuple		=  lst[j]
																UpperCamelCase_:							str		=  temp
												if (
												    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
												):  # applying bubble sort algorithm from right to left (or backwards)
																UpperCamelCase_:							Union[str, Any]		=  lst[no_of_elements - 1 - j]
																UpperCamelCase_:							Dict		=  lst[no_of_elements - 2 - j]
																UpperCamelCase_:							List[Any]		=  temp
				return lst


if __name__ == "__main__":
							print("""enter the list to be sorted""")
							lowerCamelCase_  :       Union[str, Any]					      =     [int(x) for x in input().split()]  # inputing elements of the list in one line
							lowerCamelCase_  :       Union[str, Any]					      =     double_sort(lst)
							print("""the sorted list is""")
							print(sorted_lst)






