






'''simple docstring'''






from __future__ import annotations

from math import pi

# Define the Reduced Planck Constant ℏ (H bar), speed of light C, value of
# Pi and the function
__A    	=   1.054_571_817E-34  # unit of ℏ : J * s

__A    	=   3E8  # unit of c : m * s^-1




def        _SCREAMING_SNAKE_CASE  (       A  :       float  ,		A  :       float  ,		A  :       float  )    -> dict[str, float]:







   """simple docstring"""

   if (force, area, distance).count(0  ) != 1:
      raise ValueError('One and only one argument must be 0'  )
   if force < 0:
      raise ValueError('Magnitude of force can not be negative'  )
   if distance < 0:
      raise ValueError('Distance can not be negative'  )
   if area < 0:
      raise ValueError('Area can not be negative'  )
   if force == 0:
      __snake_case				:      int     							= (REDUCED_PLANCK_CONSTANT * SPEED_OF_LIGHT * pi**2 * area) / (
          2_40 * (distance) ** 4
      )
      return {"force": force}
   elif area == 0:
      __snake_case				:      Tuple     							= (2_40 * force * (distance) ** 4) / (
          REDUCED_PLANCK_CONSTANT * SPEED_OF_LIGHT * pi**2
      )
      return {"area": area}
   elif distance == 0:
      __snake_case				:      List[str]     							= (
          (REDUCED_PLANCK_CONSTANT * SPEED_OF_LIGHT * pi**2 * area) / (2_40 * force)
      ) ** (1 / 4)
      return {"distance": distance}
   raise ValueError('One and only one argument must be 0'  )


# Run doctest
if __name__ == "__main__":
      import doctest

      doctest.testmod()







'''simple docstring'''






def        _SCREAMING_SNAKE_CASE  (				A  :       list  )    -> list:







   """simple docstring"""
   __snake_case				:      Tuple     							= False
   while is_sorted is False:  # Until all the indices are traversed keep looping
      __snake_case				:      Optional[Any]     							= True
      for i in range(0  ,		len(A  ) - 1  ,		2  ):  # iterating over all even indices
         if input_list[i] > input_list[i + 1]:
            __snake_case							,__snake_case				:      int     							= input_list[i + 1], input_list[i]
            # swapping if elements not in order
            __snake_case				:      List[Any]     							= False

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


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