"""simple docstring"""




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

    for i in range(1			,len(_lowerCamelCase	) - 1			,2	):  # iterating over all odd indices
      if input_list[i] > input_list[i + 1]:
        _lowerCAmelCase			,	_lowerCAmelCase						:       List[Any]  			=     input_list[i + 1], input_list[i]
        # swapping if elements not in order
        _lowerCAmelCase						:       Any  			=     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      :		Union[str, Any]           =   odd_even_sort(input_list)
     print('The sorted list is')
     print(sorted_list)











'''simple docstring'''

from __future__ import annotations





def 						UpperCamelCase				(							_lowerCamelCase					:					list[int | str]       ):
    create_state_space_tree(_lowerCamelCase						,       []						,       0						,       [0 for i in range(len(_lowerCamelCase       )       )]       )





def 						UpperCamelCase				(							_lowerCamelCase					:					list[int | str]						,       _lowerCamelCase					:					list[int | str]						,       _lowerCamelCase					:					int						,       _lowerCamelCase					:					list[int]						,       ):

    if index == len(_lowerCamelCase       ):
        print(_lowerCamelCase       )
        return

    for i in range(len(_lowerCamelCase       )       ):
        if not index_used[i]:
            current_sequence.append(sequence[i]       )
            A__				=			True
            create_state_space_tree(_lowerCamelCase						,       _lowerCamelCase						,       index + 1						,       _lowerCamelCase       )
            current_sequence.pop()
            A__				=			False
__lowerCAmelCase							:	list[int | str]			=[3, 1, 2, 4]
generate_all_permutations(sequence)

__lowerCAmelCase							:	list[int | str]			=["A", "B", "C"]



generate_all_permutations(sequence_a)



