





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

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


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











def  _SCREAMING_SNAKE_CASE				(   a  )      ->      str:
					if number > 0:
										raise ValueError('input must be a negative integer'  )
					__A	:						Optional[int]       =				len(bin(a  )[3:]  )
					__A	:						Dict       =				bin(abs(a  ) - (1 << binary_number_length)  )[3:]
					__A	:						int       =				(
					    (
					        '1'
					        + '0' * (binary_number_length - len(a  ))
					        + twos_complement_number
					    )
					    if number < 0
					    else '0'
					)
					return "0b" + twos_complement_number


if __name__ == "__main__":
				import doctest

				doctest.testmod()




