



def  UpperCAmelCase__    (    lowercase__ = 1_000   ) ->      int:
						return sum(2 * a * ((a - 1) // 2) for a in range(3						,       n + 1   )   )


if __name__ == "__main__":
			print(solution())










def  UpperCAmelCase__    (    lowercase__   ) ->      Optional[int]:
						__lowercase					=				len(lowercase__   )
						__lowercase					=				sum(lowercase__   )

						__lowercase					=				[[False for x in range(s + 1   )] for y in range(n + 1   )]

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

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

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

																		if arr[i - 1] <= j:
																								__lowercase					=				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:
																		__lowercase					=				s - 2 * j
																		break

						return diff





