


"""simple docstring"""


class       lowerCamelCase__    :  # Public class to implement a graph







						def __init__(				self :     int      ,      _lowercase :     Tuple      ,      _lowercase :     Optional[Any]      ,      _lowercase :     Union[str, Any]		):
								A       							=			row
								A       							=			col
								A       							=			graph







						def __a    (				self :     List[Any]      ,      _lowercase :     List[str]      ,      _lowercase :     Any      ,      _lowercase :     Tuple		):
								return (
								    0 <= i < self.ROW
								    and 0 <= j < self.COL
								    and not visited[i][j]
								    and self.graph[i][j]
								)







						def __a    (				self :     Dict      ,      _lowercase :     List[Any]      ,      _lowercase :     Dict      ,      _lowercase :     Any		):
								# Checking all 8 elements surrounding nth element
								A       							=			[-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
								A       							=			[-1, 0, 1, -1, 1, -1, 0, 1]
								A       							=			True  # Make those cells visited
								for k in range(8		):
										if self.is_safe(i + row_nbr[k]      ,      j + col_nbr[k]      ,      lowerCAmelCase__		):
												self.diffs(i + row_nbr[k]      ,      j + col_nbr[k]      ,      lowerCAmelCase__		)







						def __a    (				self :     Any		):  # And finally, count all islands.
								A       							=			[[False for j in range(self.COL		)] for i in range(self.ROW		)]
								A       							=			0
								for i in range(self.ROW		):
										for j in range(self.COL		):
												if visited[i][j] is False and self.graph[i][j] == 1:
														self.diffs(lowerCAmelCase__      ,      lowerCAmelCase__      ,      lowerCAmelCase__		)
														count += 1
								return count












"""simple docstring"""




import math






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int = 0       ,			_lowercase		:       int = 0   )					->list:






	'''simple docstring'''






	a :						Optional[Any]      =							end or len(_lowercase   )
	for i in range(_lowercase       ,			_lowercase   ):
		a :						List[str]      =							i
		a :						Any      =							array[i]
		while temp_index != start and temp_index_value < array[temp_index - 1]:
			a :						Optional[Any]      =							array[temp_index - 1]
			temp_index -= 1
		a :						Any      =							temp_index_value
	return array






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->None:  # Max Heap






	'''simple docstring'''






	a :						Tuple      =							index
	a :						List[Any]      =							2 * index + 1  # Left Node
	a :						Dict      =							2 * index + 2  # Right Node

	if left_index < heap_size and array[largest] < array[left_index]:
		a :						Dict      =							left_index

	if right_index < heap_size and array[largest] < array[right_index]:
		a :						int      =							right_index

	if largest != index:
		a,			a :						List[Any]      =							array[largest], array[index]
		heapify(_lowercase       ,			_lowercase       ,			_lowercase   )






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list   )					->list:






	'''simple docstring'''






	a :						int      =							len(_lowercase   )

	for i in range(n // 2       ,			-1       ,			-1   ):
		heapify(_lowercase       ,			_lowercase       ,			_lowercase   )

	for i in range(n - 1       ,			0       ,			-1   ):
		a,			a :						str      =							array[0], array[i]
		heapify(_lowercase       ,			0       ,			_lowercase   )

	return array






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->int:






	'''simple docstring'''






	if (array[first_index] > array[middle_index]) != (
	    array[first_index] > array[last_index]
	):
		return array[first_index]
	elif (array[middle_index] > array[first_index]) != (
	    array[middle_index] > array[last_index]
	):
		return array[middle_index]
	else:
		return array[last_index]






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->int:






	'''simple docstring'''






	a :						List[Any]      =							low
	a :						int      =							high
	while True:
		while array[i] < pivot:
			i += 1
		j -= 1
		while pivot < array[j]:
			j -= 1
		if i >= j:
			return i
		a,			a :						Union[str, Any]      =							array[j], array[i]
		i += 1






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list   )					->list:






	'''simple docstring'''






	if len(_lowercase   ) == 0:
		return array
	a :						Tuple      =							2 * math.ceil(math.loga(len(_lowercase   )   )   )
	a :						List[str]      =							16
	return intro_sort(_lowercase       ,			0       ,			len(_lowercase   )       ,			_lowercase       ,			_lowercase   )






def  _SCREAMING_SNAKE_CASE						(      _lowercase		:       list       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int       ,			_lowercase		:       int   )					->list:






	'''simple docstring'''






	while end - start > size_threshold:
		if max_depth == 0:
			return heap_sort(_lowercase   )
		max_depth -= 1
		a :						List[str]      =							median_of_a(_lowercase       ,			_lowercase       ,			start + ((end - start) // 2) + 1       ,			end - 1   )
		a :						Tuple      =							partition(_lowercase       ,			_lowercase       ,			_lowercase       ,			_lowercase   )
		intro_sort(_lowercase       ,			_lowercase       ,			_lowercase       ,			_lowercase       ,			_lowercase   )
		a :						Union[str, Any]      =							p
	return insertion_sort(_lowercase       ,			_lowercase       ,			_lowercase   )


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		a		:					Optional[int]	      =     input('''Enter numbers separated by a comma : ''').strip()
		a		:					List[str]	      =     [float(item) for item in user_input.split(''',''')]
		print(sort(unsorted))


