





'''simple docstring'''
def     lowercase__       (       __lowercase						:  Any    ,  __lowercase						:  Dict    ,  __lowercase						:  Any					)			->				Optional[int]:



       """simple docstring"""






       __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	,						__UpperCamelCase	=  unsorted[index], unsorted[largest]
              heapify(__lowercase    ,  __lowercase    ,  __lowercase					)
def     lowercase__       (       __lowercase						:  Union[str, Any]					)			->				List[Any]:



       """simple docstring"""






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


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







'''simple docstring'''
def     lowercase__       (       __lowercase						:  int = 20					)			->				int:



       """simple docstring"""






       try:
              __UpperCamelCase	=  int(__lowercase					)
       except (TypeError, ValueError):
              raise TypeError('Parameter n must be int or castable to int.'					)
       if n <= 0:
              raise ValueError('Parameter n must be greater than or equal to one.'					)
       __UpperCamelCase	=  0
       while 1:
              i += n * (n - 1)
              __UpperCamelCase	=  0
              for j in range(2    ,  __lowercase					):
                     if i % j != 0:
                            __UpperCamelCase	=  1
                            break
              if nfound == 0:
                     if i == 0:
                            __UpperCamelCase	=  1
                     return i
       return None


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