



import math

def      __lowercase(						UpperCAmelCase__ = 100			):


      """simple docstring"""



      lowerCamelCase             =		sum(i * i for i in range(1 , n + 1			)			)
      lowerCamelCase             =		int(math.pow(sum(range(1 , n + 1			)			) , 2			)			)
      return square_of_sum - sum_of_squares


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




from __future__ import annotations

def      __lowercase(						UpperCAmelCase__			):


      """simple docstring"""



      lowerCamelCase             =		2
      lowerCamelCase             =		[]
      while i * i <= n:
            if n % i:
                  i += 1
            else:
                  n //= i
                  factors.append(UpperCAmelCase__			)
      if n > 1:
            factors.append(UpperCAmelCase__			)
      return factors


if __name__ == "__main__":
     import doctest

     doctest.testmod()