


def 							__lowercase     (				__lowerCAmelCase							:       list     ):
       a__    =  False
       while is_sorted is False:  # Until all the indices are traversed keep looping
              a__    =  True
              for i in range(0      ,					len(UpperCAmelCase__     ) - 1      ,					2     ):  # iterating over all even indices
                     if input_list[i] > input_list[i + 1]:
                            a__   ,      a__    =  input_list[i + 1], input_list[i]
                            # swapping if elements not in order
                            a__    =  False

              for i in range(1      ,					len(UpperCAmelCase__     ) - 1      ,					2     ):  # iterating over all odd indices
                     if input_list[i] > input_list[i + 1]:
                            a__   ,      a__    =  input_list[i + 1], input_list[i]
                            # swapping if elements not in order
                            a__    =  False
       return input_list


if __name__ == "__main__":
      print('''Enter list to be sorted''')
      snake_case							: Any      =   [int(x) for x in input().split()]
      # inputing elements of the list in one line
      snake_case							: Tuple      =   odd_even_sort(input_list)
      print('''The sorted list is''')
      print(sorted_list)








from math import sqrt






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






def 							__lowercase     (				__lowerCAmelCase							:       int = 1_0_0_0_1     ):
							a__    =  0
							a__    =  1
							while count != nth and number < 3:
														number += 1
														if is_prime(__lowerCAmelCase     ):
																					count += 1
							while count != nth:
														number += 2
														if is_prime(__lowerCAmelCase     ):
																					count += 1
							return number


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




