



from collections.abc import Sequence




def 	UpperCAmelCase   (						_lowerCamelCase ,    _lowerCamelCase    ):
			return sum(c * (x**i) for i, c in enumerate(_lowerCamelCase    )    )




def 	UpperCAmelCase   (						_lowerCamelCase ,    _lowerCamelCase    ):
			A							:					Optional[Any]              =						0.0
			for coeff in reversed(_lowerCamelCase    ):
						A							:					List[Any]              =						result * x + coeff
			return result


if __name__ == "__main__":
							__SCREAMING_SNAKE_CASE           =  (0.0, 0.0, 5.0, 9.3, 7.0)
							__SCREAMING_SNAKE_CASE           =  10.0
							print(evaluate_poly(poly, x))
							print(horner(poly, x))




from math import sqrt




def 	UpperCAmelCase   (						_lowerCamelCase = 100_0000    ):
			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(_lowerCamelCase ,    sum_shortest_sides // 2    )
												    - max(1 ,    sum_shortest_sides - max_cuboid_size    )
												    + 1
												)

			return max_cuboid_size


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