


'''simple docstring'''



import math







def       _UpperCamelCase (						UpperCamelCase__ = 1_0_0   ):
			UpperCAmelCase__					:   List[str]       				=       sum(i * i for i in range(1	, n + 1   )   )
			UpperCAmelCase__					:   Optional[Any]       				=       int(math.pow(sum(range(1	, n + 1   )   )	, 2   )   )
			return square_of_sum - sum_of_squares


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








'''simple docstring'''



def       _UpperCamelCase (						UpperCamelCase__   ):
			UpperCAmelCase__					:   List[str]       				=       len(UpperCamelCase__   )
			UpperCAmelCase__					:   List[Any]       				=       sum(UpperCamelCase__   )

			UpperCAmelCase__					:   List[str]       				=       [[False for x in range(s + 1   )] for y in range(n + 1   )]

			for i in range(1	, n + 1   ):
						UpperCAmelCase__					:   int       				=       True

			for i in range(1	, s + 1   ):
						UpperCAmelCase__					:   Dict       				=       False

			for i in range(1	, n + 1   ):
						for j in range(1	, s + 1   ):
									UpperCAmelCase__					:   int       				=       dp[i][j - 1]

									if arr[i - 1] <= j:
												UpperCAmelCase__					:   str       				=       dp[i][j] or dp[i - 1][j - arr[i - 1]]

			for j in range(int(s / 2   )	, -1	, -1   ):
						if dp[n][j] is True:
									UpperCAmelCase__					:   int       				=       s - 2 * j
									break

			return diff