


'''simple docstring'''






def 							UpperCamelCase_     (       A__   :  int   ):
  '''simple docstring'''





  lowerCAmelCase_     : int     =  False
  while is_sorted is False:  # Until all the indices are traversed keep looping
    lowerCAmelCase_     : Union[str, 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_     : Dict     =  input_list[i + 1], input_list[i]
        # swapping if elements not in order
        lowerCAmelCase_     : Dict     =  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[str]     =  input_list[i + 1], input_list[i]
        # swapping if elements not in order
        lowerCAmelCase_     : List[str]     =  False
  return input_list


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





import math

__magic_name__  							=	10
__magic_name__  							=	7
__magic_name__  							=	BALLS_PER_COLOUR * NUM_COLOURS





def 						SCREAMING_SNAKE_CASE__     (   __lowerCAmelCase = 20				):
    snake_case__    =					math.comb(__lowerCAmelCase     ,		__lowerCAmelCase				)
    snake_case__    =					math.comb(NUM_BALLS - BALLS_PER_COLOUR     ,		__lowerCAmelCase				)

    snake_case__    =					NUM_COLOURS * (1 - missing_colour / total)

    return F"""{result:.9f}"""


if __name__ == "__main__":
     print(solution(20))



