






from collections.abc import Sequence




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




def       _SCREAMING_SNAKE_CASE (							__snake_case   ,      __snake_case )				->						float:
       _UpperCAmelCase							=    0.0
       for coeff in reversed(__snake_case ):
              _UpperCAmelCase							=    result * x + coeff
       return result


if __name__ == "__main__":
  __a:     str   					=					(0.0, 0.0, 5.0, 9.3, 7.0)
  __a:     List[str]   					=					1_0.0
  print(evaluate_poly(poly, x))
  print(horner(poly, x))






'''simple docstring'''






def   UpperCamelCase__ (						lowerCAmelCase    ):





      """simple docstring"""


      if divisor % 5 == 0 or divisor % 2 == 0:
            return 0
      _lowerCAmelCase					=				1
      _lowerCAmelCase					=				1
      while repunit:
            _lowerCAmelCase					=				(10 * repunit + 1) % divisor
            repunit_index += 1
      return repunit_index
def   UpperCamelCase__ (						lowerCAmelCase = 1_00_00_00    ):





      """simple docstring"""


      _lowerCAmelCase					=				limit - 1
      if divisor % 2 == 0:
            divisor += 1
      while least_divisible_repunit(lowerCAmelCase    ) <= limit:
            divisor += 2
      return divisor


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






