
def      __UpperCAmelCase    (  snake_case_							:		Any				):



	'''simple docstring'''



	UpperCAmelCase:					List[str] 						=     len(__lowerCAmelCase				)
	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)
				UpperCAmelCase:					Optional[int] 						=     lst[j + 1]
				UpperCAmelCase:					Optional[int] 						=     lst[j]
				UpperCAmelCase:					Dict 						=     temp
			if (
			    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
			):  # applying bubble sort algorithm from right to left (or backwards)
				UpperCAmelCase:					List[str] 						=     lst[no_of_elements - 1 - j]
				UpperCAmelCase:					int 						=     lst[no_of_elements - 2 - j]
				UpperCAmelCase:					Optional[Any] 						=     temp
	return lst


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








from __future__ import annotations

import re


def __A       ( __lowerCAmelCase      )->    list[str]:





						"""simple docstring"""



						def alphanum_key(__lowerCAmelCase      ):
												return [int(__lowerCAmelCase      ) if s.isdigit() else s.lower() for s in re.split('([0-9]+)'					,						__lowerCAmelCase      )]

						return sorted(__lowerCAmelCase					,						key=__lowerCAmelCase      )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
