




'''simple docstring'''


import sys
def 		snake_case_    (UpperCamelCase       :  int ,						UpperCamelCase       :  list[int]      ):





							'''simple docstring'''


							if not numbers:
														return 0
							if target == 0 and target in numbers:
														return 0
							if not isinstance(UpperCamelCase ,						(list, tuple)      ) or not all(
							    isinstance(UpperCamelCase ,						UpperCamelCase      ) for number in numbers      ):
														raise ValueError('''numbers must be an iterable of integers'''      )

							_a	     =				_a	     =				_a	     =				0
							_a	     =				sys.maxsize

							while right < len(UpperCamelCase      ):
														curr_sum += numbers[right]
														while curr_sum >= target and left <= right:
																					_a	     =				min(UpperCamelCase ,						right - left + 1      )
																					curr_sum -= numbers[left]
																					left += 1
														right += 1

							return 0 if min_len == sys.maxsize else min_len







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

