


import math


def       UpperCAmelCase_					(   UpperCAmelCase__	):
					lowercase_					=      []
					lowercase_					=      2
					lowercase_					=      int(math.sqrt(a_	)	)  # Size of every segment
					lowercase_					=      [True] * (end + 1)
					lowercase_					=      []

					while start <= end:
										if temp[start] is True:
															in_prime.append(a_	)
															for i in range(start * start    ,				end + 1    ,				a_	):
																				lowercase_					=      False
										start += 1
					prime += in_prime

					lowercase_					=      end + 1
					lowercase_					=      min(2 * end    ,				a_	)

					while low <= n:
										lowercase_					=      [True] * (high - low + 1)
										for each in in_prime:
															lowercase_					=      math.floor(low / each	) * each
															if t < low:
																				t += each

															for j in range(a_    ,				high + 1    ,				a_	):
																				lowercase_					=      False

										for j in range(len(a_	)	):
															if temp[j] is True:
																				prime.append(j + low	)

										lowercase_					=      high + 1
										lowercase_					=      min(high + end    ,				a_	)

					return prime



print(sieve(1_0**6))










'''simple docstring'''

def 				snake_case       (  a_				:			list						)							->					list:





      """simple docstring"""

      UpperCamelCase_					: List[str]            =				False
      while is_sorted is False:  # Until all the indices are traversed keep looping
            UpperCamelCase_					: Tuple            =				True
            for i in range(0     , len(a_						) - 1     , 2						):  # iterating over all even indices
                  if input_list[i] > input_list[i + 1]:
                        UpperCamelCase_     ,      UpperCamelCase_					: Optional[Any]            =				input_list[i + 1], input_list[i]
                        # swapping if elements not in order
                        UpperCamelCase_					: Any            =				False

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


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






