






"""simple docstring"""




from __future__ import annotations






def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	list[int | float]    ):
		if len(UpperCamelCase    ) == 0:
				raise ValueError("""find_max() arg is an empty sequence"""    )
		A__											=							nums[0]
		for x in nums:
				if x > max_num:
						A__											=							x
		return max_num


if __name__ == "__main__":
						import doctest

						doctest.testmod(verbose=True)












"""simple docstring"""




def 						_SCREAMING_SNAKE_CASE							( UpperCamelCase     :	Dict    ):
  A__											=							len(UpperCamelCase    )
  for _ in range(
      0		,				int(((no_of_elements - 1) / 2) + 1    )    ):  # we don't need to traverse to end of list as
    for j in range(0		,				no_of_elements - 1    ):
      if (
          lst[j + 1] < lst[j]
      ):  # applying bubble sort algorithm from left to right (or forwards)
        A__											=							lst[j + 1]
        A__											=							lst[j]
        A__											=							temp
      if (
          lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
      ):  # applying bubble sort algorithm from right to left (or backwards)
        A__											=							lst[no_of_elements - 1 - j]
        A__											=							lst[no_of_elements - 2 - j]
        A__											=							temp
  return lst


if __name__ == "__main__":
      print("enter the list to be sorted")
      lowerCamelCase__			=   [int(x) for x in input().split()]  # inputing elements of the list in one line
      lowerCamelCase__			=   double_sort(lst)
      print("the sorted list is")
      print(sorted_lst)




