





"""simple docstring"""



def 		__lowercase     (   snake_case_  :  int = 100						)   ->int:



    '''simple docstring'''







    __A    :						Optional[int]						 =     (n * (n + 1) // 2) ** 2
    __A    :						Optional[Any]						 =     n * (n + 1) * (2 * n + 1) // 6
    return sum_cubes - sum_squares


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











"""simple docstring"""



def 		__lowercase     (   snake_case_  :  int						)   ->int:



    '''simple docstring'''







    assert (
        isinstance(snake_case_				,snake_case_						) and number_of_steps > 0
    ), F"""number_of_steps needs to be positive integer, your input {number_of_steps}"""
    if number_of_steps == 1:
        return 1
    __A ,       __A    :						List[Any]						 =     1, 1
    for _ in range(number_of_steps - 1						):
        __A ,       __A    :						List[str]						 =     current + previous, current
    return current


if __name__ == "__main__":
       import doctest

       doctest.testmod()




