


'''simple docstring'''

def lowerCamelCase     (     lowerCAmelCase							:      Dict						):





	"""simple docstring"""







	if divisor % 5 == 0 or divisor % 2 == 0:
		return 0
	__magic_name__			:       Union[str, Any]	      =	1
	__magic_name__			:       Tuple	      =	1
	while repunit:
		__magic_name__			:       Optional[int]	      =	(10 * repunit + 1) % divisor
		repunit_index += 1
	return repunit_index





def lowerCamelCase     (     lowerCAmelCase							:      Tuple = 100_0000						):





	"""simple docstring"""







	__magic_name__			:       Optional[int]	      =	limit - 1
	if divisor % 2 == 0:
		divisor += 1
	while least_divisible_repunit(__UpperCAmelCase						) <= limit:
		divisor += 2
	return divisor


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




import math
from collections.abc import Iterator
from itertools import takewhile






def     __a					(		__UpperCAmelCase       ):

 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(__UpperCAmelCase       ) + 1       )							,  6       ):
  if number % i == 0 or number % (i + 2) == 0:
   return False
 return True






def     __a					(		):
 a__												= 2
 while True:
  if is_prime(__UpperCAmelCase       ):
   yield num
  num += 1






def     __a					(		__UpperCAmelCase = 200_0000       ):
 return sum(takewhile(lambda __UpperCAmelCase       : x < n							,  prime_generator()       )       )


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





