


def 							__lowerCAmelCase      (			__magic_name__ = 1_0_0      ):
 _lowercase:       Any						=				n * (n + 1) * (2 * n + 1) / 6
 _lowercase:       Optional[int]						=				(n * (n + 1) / 2) ** 2
 return int(square_of_sum - sum_of_squares      )


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









"""simple docstring"""


from math import sqrt


def        UpperCAmelCase      (					a__ = 1_00_00_00 ):





						'''simple docstring'''






						lowerCAmelCase   :int						=			0
						lowerCAmelCase   :int						=			0
						lowerCAmelCase   :int

						while num_cuboids <= limit:
												max_cuboid_size += 1
												for sum_shortest_sides in range(2     ,      2 * max_cuboid_size + 1 ):
																		if sqrt(sum_shortest_sides**2 + max_cuboid_size**2 ).is_integer():
																								num_cuboids += (
																								    min(a__     ,      sum_shortest_sides // 2 )
																								    - max(1     ,      sum_shortest_sides - max_cuboid_size )
																								    + 1
																								)

						return max_cuboid_size


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