




def 					SCREAMING_SNAKE_CASE							(   __UpperCamelCase)			->     Union[str, Any]:
     a      =      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)
                    a      =      lst[j + 1]
                    a      =      lst[j]
                    a      =      temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    a      =      lst[no_of_elements - 1 - j]
                    a      =      lst[no_of_elements - 2 - j]
                    a      =      temp
     return lst


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








'''simple docstring'''



import math




def       _lowerCAmelCase  ( lowerCamelCase_	:     int ):

			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 = 6_0_0_8_5_1_4_7_5_1_4_3 ):

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


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





