



import math





def      __snake_case	(			_UpperCAmelCase = 100				):
    __a						       =				sum(i * i for i in range(1   , n + 1				)				)
    __a						       =				int(math.pow(sum(range(1   , n + 1				)				)   , 2				)				)
    return square_of_sum - sum_of_squares


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







from functools import lru_cache



@lru_cache
def        UpperCamelCase    (							lowerCAmelCase__		):
					'''simple docstring'''
					if num < 0:
										raise ValueError('''Number should not be negative.'''		)

					return 1 if num in (0, 1) else num * factorial(num - 1		)


if __name__ == "__main__":
							import doctest

							doctest.testmod()




