from math import sqrt
def       A	(    _lowercase = 1_000_000						):
						SCREAMING_SNAKE_CASE							:    int							=							0
						SCREAMING_SNAKE_CASE							:    int							=							0
						SCREAMING_SNAKE_CASE							:    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(_lowercase		,  sum_shortest_sides // 2						)
																								    - max(1		,  sum_shortest_sides - max_cuboid_size						)
																								    + 1
																								)

						return max_cuboid_size


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






import math
def       A	(    _lowercase						):
						return math.sqrt(_lowercase						) * math.sqrt(_lowercase						) == num
def       A	(    _lowercase						):
						SCREAMING_SNAKE_CASE							:    Dict							=							0
						SCREAMING_SNAKE_CASE							:    Tuple							=							n
						while left <= right:
												SCREAMING_SNAKE_CASE							:    Union[str, Any]							=							(left + right) // 2
												if mid**2 == n:
																		return True
												elif mid**2 > n:
																		SCREAMING_SNAKE_CASE							:    Optional[Any]							=							mid - 1
												else:
																		SCREAMING_SNAKE_CASE							:    Optional[int]							=							mid + 1
						return False


if __name__ == "__main__":
					import doctest

					doctest.testmod()





