




'''simple docstring'''
def 							snake_case_    (  a__						:      Dict       ,a__						:      Dict       ,a__						:      Any     ):



    """simple docstring"""




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

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

    if largest != index:
        __lowercase							,__lowercase     							=		unsorted[index], unsorted[largest]
        heapify(a__       ,a__       ,a__     )
def 							snake_case_    (  a__						:      List[str]     ):



    """simple docstring"""




    __lowercase     							=		len(a__     )
    for i in range(n // 2 - 1       ,-1       ,-1     ):
        heapify(a__       ,a__       ,a__     )
    for i in range(n - 1       ,0       ,-1     ):
        __lowercase							,__lowercase     							=		unsorted[i], unsorted[0]
        heapify(a__       ,0       ,a__     )
    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'''
from math import gcd
def 							snake_case_    (  a__						:      int = 1_20_00     ):



    """simple docstring"""




    __lowercase     							=		0
    for d in range(max_d + 1     ):
        for n in range(d // 3 + 1       ,(d + 1) // 2     ):
            if gcd(a__       ,a__     ) == 1:
                fractions_number += 1
    return fractions_number


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




