"""simple docstring"""




def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       int	)       ->      int:
  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  _lowerCAmelCase						:       Any  			=     1
  _lowerCAmelCase						:       Optional[Any]  			=     1
  while repunit:
    _lowerCAmelCase						:       List[Any]  			=     (10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index





def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       int = 1000000	)       ->      int:
  _lowerCAmelCase						:       Optional[Any]  			=     limit - 1
  if divisor % 2 == 0:
    divisor += 1
  while least_divisible_repunit(_lowerCamelCase	) <= limit:
    divisor += 2
  return divisor


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











def    __lowercase   (      _SCREAMING_SNAKE_CASE = 10	) ->   str:


      '''simple docstring'''


      if not isinstance(_SCREAMING_SNAKE_CASE ,						_SCREAMING_SNAKE_CASE	) or n < 0:
            raise ValueError("""Invalid input"""	)
      SCREAMING_SNAKE_CASE		=						10**n
      SCREAMING_SNAKE_CASE		=						2_84_33 * (pow(2 ,						7_83_04_57 ,						_SCREAMING_SNAKE_CASE	)) + 1
      return str(number % modulus	)


if __name__ == "__main__":
      from doctest import testmod

      testmod()
      print(F'''{solution(1_0) = }''')


