






def __A       ( __lowerCAmelCase      )->    Union[str, Any]:





						"""simple docstring"""



						_UpperCAmelCase							   =     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							   =     lst[j + 1]
																								_UpperCAmelCase							   =     lst[j]
																								_UpperCAmelCase							   =     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							   =     lst[no_of_elements - 1 - j]
																								_UpperCAmelCase							   =     lst[no_of_elements - 2 - j]
																								_UpperCAmelCase							   =     temp
						return lst


if __name__ == "__main__":
		print('''enter the list to be sorted''')
		_a       =    [int(x) for x in input().split()]  # inputing elements of the list in one line
		_a       =    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()
