

def 						UpperCamelCase_(			snake_case__:  Optional[int]  ,    snake_case__:  List[Any]  ,    snake_case__:  str   )       -> Union[str, Any]:
 UpperCAmelCase__							=				index
 UpperCAmelCase__							=				2 * index + 1
 UpperCAmelCase__							=				2 * index + 2
 if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
  UpperCAmelCase__							=				left_index

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

 if largest != index:
  UpperCAmelCase__							=				unsorted[index], unsorted[largest]
  heapify(UpperCamelCase_  ,    UpperCamelCase_  ,    UpperCamelCase_   )
def 						UpperCamelCase_(			snake_case__:  Union[str, Any]   )       -> List[str]:
 UpperCAmelCase__							=				len(UpperCamelCase_   )
 for i in range(n // 2 - 1  ,    -1  ,    -1   ):
  heapify(UpperCamelCase_  ,    UpperCamelCase_  ,    UpperCamelCase_   )
 for i in range(n - 1  ,    0  ,    -1   ):
  UpperCAmelCase__							=				unsorted[i], unsorted[0]
  heapify(UpperCamelCase_  ,    0  ,    UpperCamelCase_   )
 return unsorted


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









def 							_UpperCAmelCase     (UpperCamelCase_       :       int					,			UpperCamelCase_       :       Optional[int]				):
				'''simple docstring'''
				_lowerCAmelCase			:			Dict        =					len(UpperCamelCase_				)
				# Create a stack and push index of fist element to it
				_lowerCAmelCase			:			Tuple        =					[]
				st.append(0				)

				# Span value of first element is always 1
				_lowerCAmelCase			:			List[Any]        =					1

				# Calculate span values for rest of the elements
				for i in range(1					,			UpperCamelCase_				):
								# Pop elements from stack while stack is not
								# empty and top of stack is smaller than price[i]
								while len(UpperCamelCase_				) > 0 and price[st[0]] <= price[i]:
												st.pop()

								# If stack becomes empty, then price[i] is greater
								# than all elements on left of it, i.e. price[0],
								# price[1], ..price[i-1]. Else the price[i]  is
								# greater than elements after top of stack
								_lowerCAmelCase			:			Union[str, Any]        =					i + 1 if len(UpperCamelCase_				) <= 0 else (i - st[0])

								# Push this element to stack
								st.append(UpperCamelCase_				)




def 							_UpperCAmelCase     (UpperCamelCase_       :       Dict					,			UpperCamelCase_       :       Union[str, Any]				):
				'''simple docstring'''
				for i in range(0					,			UpperCamelCase_				):
								print(arr[i]					,			end=""" """				)


# Driver program to test above function
_lowerCamelCase					:     Union[str, Any]					  =  [1_0, 4, 5, 9_0, 1_2_0, 8_0]
_lowerCamelCase					:     List[Any]					  =  [0 for i in range(len(price) + 1)]

# Fill the span values in array S[]
calculation_span(price, S)





print_array(S, len(price))

