

def  snake_case_(_UpperCamelCase					,			_UpperCamelCase	)				->      Any:



  """simple docstring"""






  if n == 0:
    return 1

  elif n % 2 == 1:
    return binary_exponentiation(_UpperCamelCase					,			n - 1	) * a

  else:
    _snake_case		=				binary_exponentiation(_UpperCamelCase					,			n / 2	)
    return b * b


if __name__ == "__main__":
 try:
  __A     						=      int(input('''Enter Base : ''').strip())
  __A     						=      int(input('''Enter Power : ''').strip())
 except ValueError:
  print('''Invalid literal for integer''')

 __A     						=      binary_exponentiation(BASE, POWER)
 print(f'''{BASE}^({POWER}) : {RESULT}''')




def  snake_case_(_UpperCamelCase					,			_UpperCamelCase					,			_UpperCamelCase	)				->      Optional[Any]:



  """simple docstring"""






  _snake_case		=				index
  _snake_case		=				2 * index + 1
  _snake_case		=				2 * index + 2
  if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
    _snake_case		=				left_index

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

  if largest != index:
    _snake_case,	_snake_case		=				unsorted[index], unsorted[largest]
    heapify(_UpperCamelCase					,			_UpperCamelCase					,			_UpperCamelCase	)



def  snake_case_(_UpperCamelCase	)				->      Any:



  """simple docstring"""






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


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

