

from math import sqrt





def  __lowerCamelCase     (			UpperCamelCase__ = 1000000				):







							'''simple docstring'''






							snake_case_          =   0
							snake_case_          =   0
							snake_case_          =   42

							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() = }''')







def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							snake_case_          =   1
							snake_case_          =   2
							while i * i <= n:
														snake_case_          =   0
														while n % i == 0:
																					n //= i
																					multiplicity += 1
														n_divisors *= multiplicity + 1
														i += 1
							if n > 1:
														n_divisors *= 2
							return n_divisors





def  __lowerCamelCase     (			):







							'''simple docstring'''






							snake_case_          =   1
							snake_case_          =   1

							while True:
														i += 1
														t_num += i

														if count_divisors(UpperCamelCase__				) > 500:
																					break

							return t_num


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




