

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))













"""simple docstring"""


import itertools
import math


def        UpperCAmelCase      (					a__ ):





						'''simple docstring'''






						if 1 < number < 4:
												# 2 and 3 are primes
												return True
						elif number < 2 or number % 2 == 0 or number % 3 == 0:
												# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
												return False

						# All primes number are in format of 6k +/- 1
						for i in range(5     ,      int(math.sqrt(a__ ) + 1 )     ,      6 ):
												if number % i == 0 or number % (i + 2) == 0:
																		return False
						return True


def        UpperCAmelCase      (					):





						'''simple docstring'''






						lowerCAmelCase   :str						=			2
						while True:
												if is_prime(a__ ):
																		yield num
												num += 1


def        UpperCAmelCase      (					a__ = 1_00_01 ):





						'''simple docstring'''






						return next(itertools.islice(prime_generator()     ,      nth - 1     ,      a__ ) )


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