

"""simple docstring"""




def    __SCREAMING_SNAKE_CASE						(						lowercase__ = 30      ):
					"""simple docstring"""
					A			=					exponent + 2
					A			=					(1 + 5**0.5) / 2
					A			=					(phi**fibonacci_index - (phi - 1) ** fibonacci_index) / 5**0.5

					return int(lowercase__      )


if __name__ == "__main__":
	print(f"""{solution() = }""")








"""simple docstring"""




def    __SCREAMING_SNAKE_CASE						(						lowercase__			,							lowercase__			,							lowercase__      ):
					"""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(lowercase__			,							lowercase__			,							lowercase__      )
def    __SCREAMING_SNAKE_CASE						(						lowercase__      ):
					"""simple docstring"""
					A			=					len(lowercase__      )
					for i in range(n // 2 - 1			,							-1			,							-1      ):
										heapify(lowercase__			,							lowercase__			,							lowercase__      )
					for i in range(n - 1			,							0			,							-1      ):
										A			,    A			=					unsorted[i], unsorted[0]
										heapify(lowercase__			,							0			,							lowercase__      )
					return unsorted


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





