

from math import sqrt
def 							__SCREAMING_SNAKE_CASE     (   a__    :   int = 1000000       )					->				int:
	__A :			int		    =			0
	__A :			int		    =			0
	__A :			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() = }""")








from collections.abc import Sequence
def 							__SCREAMING_SNAKE_CASE     (   a__    :   Sequence[float]			,a__    :   float       )					->				float:
	return sum(c * (x**i) for i, c in enumerate(a__       )       )
def 							__SCREAMING_SNAKE_CASE     (   a__    :   Sequence[float]			,a__    :   float       )					->				float:
	__A :			Any		    =			0.0
	for coeff in reversed(a__       ):
		__A :			List[str]		    =			result * x + coeff
	return result


if __name__ == "__main__":
			UpperCAmelCase_							:					List[str]		 =   (0.0, 0.0, 5.0, 9.3, 7.0)
			UpperCAmelCase_							:					str		 =   10.0
			print(evaluate_poly(poly, x))
			print(horner(poly, x))





