






from __future__ import annotations

UpperCamelCase__ =			[-10, -5, 0, 5, 5.1, 11, 13, 21, 3, 4, -21, -10, -5, -1, 0]
UpperCamelCase__ =			[-5, 0, 5, 5.1, 11, 13, 21, -1, 4, -1, -10, -5, -1, 0, -1]




def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




   lowercase_	:    str           =     []
   lowercase_	:    List[str]           =     len(_UpperCamelCase							)

   for i in range(_UpperCamelCase							):
      lowercase_	:    float           =     -1
      for j in range(i + 1						,		_UpperCamelCase							):
         if arr[i] < arr[j]:
            lowercase_	:    Union[str, Any]           =     arr[j]
            break
      result.append(_UpperCamelCase							)
   return result




def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




   lowercase_	:    List[str]           =     []
   for i, outer in enumerate(_UpperCamelCase							):
      lowercase_	:    float           =     -1
      for inner in arr[i + 1 :]:
         if outer < inner:
            lowercase_	:    Optional[Any]           =     inner
            break
      result.append(_UpperCamelCase							)
   return result




def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




   lowercase_	:    List[str]           =     len(_UpperCamelCase							)
   lowercase_	:    list[float]           =     []
   lowercase_	:    list[float]           =     [-1] * arr_size

   for index in reversed(range(_UpperCamelCase							)							):
      if stack:
         while stack[-1] <= arr[index]:
            stack.pop()
            if not stack:
               break
      if stack:
         lowercase_	:    Optional[Any]           =     stack[-1]
      stack.append(arr[index]							)
   return result


if __name__ == "__main__":
 from doctest import testmod
 from timeit import timeit

 testmod()
 print(next_greatest_element_slow(arr))
 print(next_greatest_element_fast(arr))
 print(next_greatest_element(arr))

 UpperCamelCase__ =			(
     'from __main__ import arr, next_greatest_element_slow, '
     'next_greatest_element_fast, next_greatest_element'
 )
 print(
     'next_greatest_element_slow():',
     timeit('next_greatest_element_slow(arr)', setup=setup),
 )
 print(
     'next_greatest_element_fast():',
     timeit('next_greatest_element_fast(arr)', setup=setup),
 )
 print(
     '     next_greatest_element():',
     timeit('next_greatest_element(arr)', setup=setup),
 )












'''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)




