




'''simple docstring'''


def 		snake_case_    (UpperCamelCase       :  int      ):





							'''simple docstring'''


							_a	     =				1
							_a	     =				0
							_a	     =				1
							_a	     =				1
							_a	     =				3
							_a	     =				3
							_a	     =				limit
							_a	     =				0

							_a	     =				''''''
							while counter != decimal + 1:
														if 4 * q + r - t < n * t:
																					result += str(UpperCamelCase      )
																					if counter == 0:
																												result += "."

																					if decimal == counter:
																												break

																					counter += 1
																					_a	     =				10 * (r - n * t)
																					_a	     =				((10 * (3 * q + r)) // t) - 10 * n
																					q *= 10
																					_a	     =				nr
														else:
																					_a	     =				(2 * q + r) * l
																					_a	     =				(q * (7 * k) + 2 + (r * l)) // (t * l)
																					q *= k
																					t *= l
																					l += 2
																					k += 1
																					_a	     =				nn
																					_a	     =				nr
							return result
def 		snake_case_    ():





							'''simple docstring'''


							print(f'{calculate_pi(50      ) = }'      )
							import doctest

							doctest.testmod()


if __name__ == "__main__":
				main()







'''simple docstring'''


def 		snake_case_    (UpperCamelCase       :  List[str] ,						UpperCamelCase       :  List[Any] ,						UpperCamelCase       :  Union[str, Any]      ):





							'''simple docstring'''


							_a	     =				index
							_a	     =				2 * index + 1
							_a	     =				2 * index + 2
							if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
														_a	     =				left_index

							if right_index < heap_size and unsorted[right_index] > unsorted[largest]:
														_a	     =				right_index

							if largest != index:
														_a     ,							_a	     =				unsorted[index], unsorted[largest]
														heapify(UpperCamelCase ,						UpperCamelCase ,						UpperCamelCase      )
def 		snake_case_    (UpperCamelCase       :  Union[str, Any]      ):





							'''simple docstring'''


							_a	     =				len(UpperCamelCase      )
							for i in range(n // 2 - 1 ,						-1 ,						-1      ):
														heapify(UpperCamelCase ,						UpperCamelCase ,						UpperCamelCase      )
							for i in range(n - 1 ,						0 ,						-1      ):
														_a     ,							_a	     =				unsorted[i], unsorted[0]
														heapify(UpperCamelCase ,						0 ,						UpperCamelCase      )
							return unsorted


if __name__ == "__main__":
				_snake_case      :      int   							=		input('Enter numbers separated by a comma:\n').strip()
				_snake_case      :      Optional[Any]   							=		[int(item) for item in user_input.split(',')]
				print(heap_sort(unsorted))

