


def   lowerCamelCase(				a__):
				_SCREAMING_SNAKE_CASE     					=len(a__)
				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)
																_SCREAMING_SNAKE_CASE     					=lst[j + 1]
																_SCREAMING_SNAKE_CASE     					=lst[j]
																_SCREAMING_SNAKE_CASE     					=temp
												if (
												    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
												):  # applying bubble sort algorithm from right to left (or backwards)
																_SCREAMING_SNAKE_CASE     					=lst[no_of_elements - 1 - j]
																_SCREAMING_SNAKE_CASE     					=lst[no_of_elements - 2 - j]
																_SCREAMING_SNAKE_CASE     					=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_  :     str							  =							double_sort(lst)
							print('''the sorted list is''')
							print(sorted_lst)



import math

class   A__							:




						def __init__(    self   : Optional[int]			,      _a   : int			,      _a   : List[Any]			,      _a   : int					)							->       Optional[int]:


										"""simple docstring"""





										_SCREAMING_SNAKE_CASE     					=x
										_SCREAMING_SNAKE_CASE     					=y
										_SCREAMING_SNAKE_CASE     					=z




						def __repr__(    self   : List[str]					)							->       str:


										"""simple docstring"""





										return f"Point({self.x}, {self.y}, {self.z})"







def   lowerCamelCase(				a__		,a__):
				return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2))


if __name__ == "__main__":
							import doctest

							doctest.testmod()