






def    a_       (					_A = 100     )	->	int:







				"""simple docstring"""
				snake_case__													=   n * (n + 1) * (2 * n + 1) / 6
				snake_case__													=   (n * (n + 1) / 2) ** 2
				return int(square_of_sum - sum_of_squares     )


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











def lowerCamelCase__    (							)      ->				int:
   return [
       a * b * (1000 - a - b)
       for a in range(1       ,      999       )
       for b in range(snake_case_       ,      999       )
       if (a * a + b * b == (1000 - a - b) ** 2)
   ][0]


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

