




"""simple docstring"""



from collections.abc import Sequence







def   _SCREAMING_SNAKE_CASE       (							lowercase_      ,			lowercase_						)						->		float:
 return sum(c * (x**i) for i, c in enumerate(lowercase_						)						)







def   _SCREAMING_SNAKE_CASE       (							lowercase_      ,			lowercase_						)						->		float:
 A__	=    0.0
 for coeff in reversed(lowercase_						):
  A__	=    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))











"""simple docstring"""



import random

from .binary_exp_mod import bin_exp_mod







def   _SCREAMING_SNAKE_CASE       (							lowercase_      ,			lowercase_=10_00						)						->		Optional[Any]:
 if n < 2:
  return False

 if n % 2 == 0:
  return n == 2

 # this means n is odd
 A__	=    n - 1
 A__	=    0
 while d % 2 == 0:
  d /= 2
  exp += 1

 # n - 1=d*(2**exp)
 A__	=    0
 while count < prec:
  A__	=    random.randint(2      ,			n - 1						)
  A__	=    bin_exp_mod(lowercase_      ,			lowercase_      ,			lowercase_						)
  if b != 1:
   A__	=    True
   for _ in range(lowercase_						):
    if b == n - 1:
     A__	=    False
     break
    A__	=    b * b
    b %= n
   if flag:
    return False
   count += 1
 return True


if __name__ == "__main__":
      SCREAMING_SNAKE_CASE    =	abs(int(input("Enter bound : ").strip()))
      print("Here's the list of primes:")
      print(", ".join(str(i) for i in range(n + 1) if is_prime_big(i)))





