






'''simple docstring'''

def 	_UpperCAmelCase    (  a		:	list							)			->			list:





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

												for i in range(1						,			len(a							) - 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_      :   Dict        =			False
						return input_list


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








'''simple docstring'''

def 	_UpperCAmelCase    (  a		:	int						,			a		:	int							)			->			int:





						"""simple docstring"""
						while second != 0:
												lowercase_      :   Any        =			first & second
												first ^= second
												lowercase_      :   List[str]        =			c << 1
						return first


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						A:      Union[str, Any]  				=				int(input("Enter the first number: ").strip())
						A:      Union[str, Any]  				=				int(input("Enter the second number: ").strip())
						print(f"""{add(first, second) = }""")
