
def 		SCREAMING_SNAKE_CASE__			(					__lowerCAmelCase			,						__lowerCAmelCase							):
    snake_case__  = []
    snake_case__  = len(lowercase__							)
    for i in range(lowercase__							):
        snake_case__  = []
        for j in range(lowercase__							):
            snake_case__  = 0
            for k in range(lowercase__							):
                snake_case__  = val + matrix_a[i][k] * matrix_b[k][j]
            list_a.append(lowercase__							)
        matrix_c.append(lowercase__							)
    return matrix_c





def 		SCREAMING_SNAKE_CASE__			(					__lowerCAmelCase							):
    return [[int(row == column							) for column in range(lowercase__							)] for row in range(lowercase__							)]





def 		SCREAMING_SNAKE_CASE__			(					__lowerCAmelCase							):
    if n <= 1:
        return n
    snake_case__  = identity(2							)
    snake_case__  = [[1, 1], [1, 0]]
    snake_case__  = n - 1
    while n > 0:
        if n % 2 == 1:
            snake_case__  = multiply(lowercase__			,						lowercase__							)
        snake_case__  = multiply(lowercase__			,						lowercase__							)
        snake_case__  = int(n / 2							)
    return res_matrix[0][0]





def 		SCREAMING_SNAKE_CASE__			(					__lowerCAmelCase							):
    if n <= 1:
        return n
    snake_case__  = 0
    snake_case__  = 1
    for _ in range(2			,						n + 1							):
        snake_case__  ,    snake_case__  = fiba, fiba + fiba
    return fiba





def 		SCREAMING_SNAKE_CASE__			(					):
    for ordinal in "0th 1st 2nd 3rd 10th 100th 1000th".split():
        snake_case__  = int("".join(c for c in ordinal if c in "0123456789"							)							)  # 1000th --> 1000
        print(
            F"""{ordinal} fibonacci number using matrix exponentiation is """
            F"""{nth_fibonacci_matrix(lowercase__							)} and using bruteforce is """
            F"""{nth_fibonacci_bruteforce(lowercase__							)}\n"""							)
    # from timeit import timeit
    # print(timeit("nth_fibonacci_matrix(1000000)",
    #              "from main import nth_fibonacci_matrix", number=5))
    # print(timeit("nth_fibonacci_bruteforce(1000000)",
    #              "from main import nth_fibonacci_bruteforce", number=5))
    # 2.3342058970001744
    # 57.256506615000035


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     main()






"""simple docstring"""




def    __SCREAMING_SNAKE_CASE						(						lowercase__			,							lowercase__			,							lowercase__      ):
					"""simple docstring"""
					A			=					index
					A			=					2 * index + 1
					A			=					2 * index + 2
					if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
										A			=					left_index

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

					if largest != index:
										A			,    A			=					unsorted[index], unsorted[largest]
										heapify(lowercase__			,							lowercase__			,							lowercase__      )
def    __SCREAMING_SNAKE_CASE						(						lowercase__      ):
					"""simple docstring"""
					A			=					len(lowercase__      )
					for i in range(n // 2 - 1			,							-1			,							-1      ):
										heapify(lowercase__			,							lowercase__			,							lowercase__      )
					for i in range(n - 1			,							0			,							-1      ):
										A			,    A			=					unsorted[i], unsorted[0]
										heapify(lowercase__			,							0			,							lowercase__      )
					return unsorted


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





