'''simple docstring'''




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

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


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





'''simple docstring'''




def _UpperCamelCase   (       SCREAMING_SNAKE_CASE_							):
     lowercase_					:       List[Any]     				=					len(SCREAMING_SNAKE_CASE_							)
     for _ in range(SCREAMING_SNAKE_CASE_							):
          for i in range(_ % 2  ,       arr_size - 1  ,       2							):
               if arr[i + 1] < arr[i]:
                    lowercase_				,lowercase_					:       Optional[Any]     				=					arr[i + 1], arr[i]

     return arr


if __name__ == "__main__":
 _A								=   list(range(1_0, 0, -1))
 print(F"""Original: {arr}. Sorted: {odd_even_transposition(arr)}""")




