





'''simple docstring'''

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

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


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










'''simple docstring'''

import warnings


warnings.warn(
    "memory_utils has been reorganized to utils.memory. Import `find_executable_batchsize` from the main `__init__`: "
    "`from accelerate import find_executable_batch_size` to avoid this warning.",
    FutureWarning,
)



