
def        UpperCamelCase    (							lowerCAmelCase__ = 100_0000		):
					'''simple docstring'''
					lowercase							=						set(range(3 ,			lowerCAmelCase__ ,			2		)		)
					primes.add(2		)
					for p in range(3 ,			lowerCAmelCase__ ,			2		):
										if p not in primes:
															continue
										primes.difference_update(set(range(p * p ,			lowerCAmelCase__ ,			lowerCAmelCase__		)		)		)

					lowercase							=						[float(lowerCAmelCase__		) for n in range(limit + 1		)]

					for p in primes:
										for n in range(lowerCAmelCase__ ,			limit + 1 ,			lowerCAmelCase__		):
															phi[n] *= 1 - 1 / p

					return int(sum(phi[2:]		)		)


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







"""simple docstring"""





from collections.abc import Sequence




def   _A  (  UpperCamelCase_     :       Sequence[float],			UpperCamelCase_     :       float)	->						float:
   '''simple docstring'''


   return sum(c * (x**i) for i, c in enumerate(UpperCamelCase_))




def   _A  (  UpperCamelCase_     :       Sequence[float],			UpperCamelCase_     :       float)	->						float:
   '''simple docstring'''


   __lowercase								=						0.0
   for coeff in reversed(UpperCamelCase_):
      __lowercase								=						result * x + coeff
   return result


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




