





"""simple docstring"""




def 		UpperCAmelCase__						(	_UpperCAmelCase   ):






  """simple docstring"""





  return int(_UpperCAmelCase   ) if x - int(_UpperCAmelCase   ) <= 0 else int(_UpperCAmelCase   ) + 1


if __name__ == "__main__":
   import doctest

   doctest.testmod()




'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:int			)		->						Any:
				snake_case__      :   Dict      =    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)
																snake_case__      :   int      =    lst[j + 1]
																snake_case__      :   Tuple      =    lst[j]
																snake_case__      :   Tuple      =    temp
												if (
												    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
												):  # applying bubble sort algorithm from right to left (or backwards)
																snake_case__      :   Optional[Any]      =    lst[no_of_elements - 1 - j]
																snake_case__      :   Tuple      =    lst[no_of_elements - 2 - j]
																snake_case__      :   Any      =    temp
				return lst


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




