




'''simple docstring'''


import math
def 		snake_case_    (UpperCamelCase       :  int      ):





							'''simple docstring'''


							if n <= 0:
														raise ValueError('''Only positive integers have prime factors'''      )
							_a	     =				[]
							while n % 2 == 0:
														pf.append(2      )
														_a	     =				int(n / 2      )
							for i in range(3 ,						int(math.sqrt(UpperCamelCase      )      ) + 1 ,						2      ):
														while n % i == 0:
																					pf.append(UpperCamelCase      )
																					_a	     =				int(n / i      )
							if n > 2:
														pf.append(UpperCamelCase      )
							return pf
def 		snake_case_    (UpperCamelCase       :  int      ):





							'''simple docstring'''


							if n <= 0:
														raise ValueError('''Only positive numbers are accepted'''      )
							_a	     =				1
							_a	     =				1
							while n % 2 == 0:
														temp += 1
														_a	     =				int(n / 2      )
							div *= temp
							for i in range(3 ,						int(math.sqrt(UpperCamelCase      )      ) + 1 ,						2      ):
														_a	     =				1
														while n % i == 0:
																					temp += 1
																					_a	     =				int(n / i      )
														div *= temp
							if n > 1:
														div *= 2
							return div
def 		snake_case_    (UpperCamelCase       :  int      ):





							'''simple docstring'''


							if n <= 0:
														raise ValueError('''Only positive numbers are accepted'''      )
							_a	     =				1
							_a	     =				1
							while n % 2 == 0:
														temp += 1
														_a	     =				int(n / 2      )
							if temp > 1:
														s *= (2**temp - 1) / (2 - 1)
							for i in range(3 ,						int(math.sqrt(UpperCamelCase      )      ) + 1 ,						2      ):
														_a	     =				1
														while n % i == 0:
																					temp += 1
																					_a	     =				int(n / i      )
														if temp > 1:
																					s *= (i**temp - 1) / (i - 1)
							return int(UpperCamelCase      )
def 		snake_case_    (UpperCamelCase       :  int      ):





							'''simple docstring'''


							_a	     =				n
							for x in set(prime_factors(UpperCamelCase      )      ):
														s *= (x - 1) / x
							return int(UpperCamelCase      )


if __name__ == "__main__":
				import doctest

				doctest.testmod()







'''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))

