



from functools import lru_cache

@lru_cache
def  lowerCamelCase_(lowerCamelCase_     )			->							Optional[Any]:




						if num < 0:
												raise ValueError("Number should not be negative."     )

						return 1 if num in (0, 1) else num * factorial(num - 1     )


if __name__ == "__main__":
		import doctest

		doctest.testmod()







"""simple docstring"""


def _lowerCamelCase      (						_UpperCamelCase ):

			'''simple docstring'''




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

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


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




