






'''simple docstring'''
from __future__ import annotations

import numpy as np




def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




   lowercase_    ,		lowercase_	:    Tuple           =     np.shape(_UpperCamelCase							)
   if rows != columns:
      lowercase_	:    List[str]           =     (
          "'table' has to be of square shaped array but got a "
          F"""{rows}x{columns} array:\n{table}"""
      )
      raise ValueError(_UpperCamelCase							)

   lowercase_	:    Dict           =     np.zeros((rows, columns)							)
   lowercase_	:    Any           =     np.zeros((rows, columns)							)
   for i in range(_UpperCamelCase							):
      for j in range(_UpperCamelCase							):
         lowercase_	:    List[str]           =     sum(lower[i][k] * upper[k][j] for k in range(_UpperCamelCase							)							)
         if upper[j][j] == 0:
            raise ArithmeticError("No LU decomposition exists"							)
         lowercase_	:    str           =     (table[i][j] - total) / upper[j][j]
      lowercase_	:    Tuple           =     1
      for j in range(_UpperCamelCase						,		_UpperCamelCase							):
         lowercase_	:    int           =     sum(lower[i][k] * upper[k][j] for k in range(_UpperCamelCase							)							)
         lowercase_	:    Optional[int]           =     table[i][j] - total
   return lower, upper


if __name__ == "__main__":
 import doctest

 doctest.testmod()












'''simple docstring'''
def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




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

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


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




