

from itertools import combinations_with_replacement





def 							__a       (					__A = 100	):
    SCREAMING_SNAKE_CASE__					     =						[*list(range(1 ,       21	)	), 25]
    SCREAMING_SNAKE_CASE__					     =						[2 * x for x in range(1 ,       21	)] + [50]
    SCREAMING_SNAKE_CASE__					     =						[3 * x for x in range(1 ,       21	)]
    SCREAMING_SNAKE_CASE__					     =						singles + doubles + triples + [0]

    SCREAMING_SNAKE_CASE__					     =						0
    SCREAMING_SNAKE_CASE__					     =						42
    SCREAMING_SNAKE_CASE__					     =						42
    SCREAMING_SNAKE_CASE__					     =						42
    SCREAMING_SNAKE_CASE__					     =						42

    for double in doubles:
        for throwa, throwa in combinations_with_replacement(__A ,       2	):
            SCREAMING_SNAKE_CASE__					     =						double + throwa + throwa
            if checkout_total < limit:
                num_checkouts += 1

    return num_checkouts


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





def 							__a       (					__A ,       __A ,       __A	):
    SCREAMING_SNAKE_CASE__					     =						index
    SCREAMING_SNAKE_CASE__					     =						2 * index + 1
    SCREAMING_SNAKE_CASE__					     =						2 * index + 2
    if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
        SCREAMING_SNAKE_CASE__					     =						left_index

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

    if largest != index:
        SCREAMING_SNAKE_CASE__     ,		SCREAMING_SNAKE_CASE__					     =						unsorted[index], unsorted[largest]
        heapify(__A ,       __A ,       __A	)





def 							__a       (					__A	):
    SCREAMING_SNAKE_CASE__					     =						len(__A	)
    for i in range(n // 2 - 1 ,       -1 ,       -1	):
        heapify(__A ,       __A ,       __A	)
    for i in range(n - 1 ,       0 ,       -1	):
        SCREAMING_SNAKE_CASE__     ,		SCREAMING_SNAKE_CASE__					     =						unsorted[i], unsorted[0]
        heapify(__A ,       0 ,       __A	)
    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))


