





'''simple docstring'''




def 			_lowerCAmelCase     (    __snake_case    :					list     )	->	list:
     __A		:					Dict						=			False
     while is_sorted is False:  # Until all the indices are traversed keep looping
          __A		:					int						=			True
          for i in range(0					,				len(__snake_case     ) - 1					,				2     ):  # iterating over all even 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

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


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




'''simple docstring'''
def A__       (	UpperCAmelCase_    ,    UpperCAmelCase_				):
						return int((input_a, input_a).count(0				) != 0				)






def A__       (	):
						assert nand_gate(0    ,    0				) == 1
						assert nand_gate(0    ,    1				) == 1
						assert nand_gate(1    ,    0				) == 1
						assert nand_gate(1    ,    1				) == 0


if __name__ == "__main__":
					print(nand_gate(0, 0))
					print(nand_gate(0, 1))
					print(nand_gate(1, 0))
					print(nand_gate(1, 1))


