"""simple docstring"""
def 						__a   (	_SCREAMING_SNAKE_CASE   )	->int:


  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  a__:     Tuple										=	1
  a__:     int										=	1
  while repunit:
    a__:     str										=	(10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index







def 						__a   (	_SCREAMING_SNAKE_CASE = 1000000   )	->int:
  a__:     Dict										=	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 os
from math import logaa






def 							_lowercase							(     UpperCamelCase_ = "base_exp.txt"		)		->		int:
					'''simple docstring'''


					SCREAMING_SNAKE_CASE__													= 0
					SCREAMING_SNAKE_CASE__													= 0
					for i, line in enumerate(open(os.path.join(os.path.dirname(UpperCamelCase_		)	,	UpperCamelCase_		)		)		):
										SCREAMING_SNAKE_CASE__						, SCREAMING_SNAKE_CASE__													= list(map(UpperCamelCase_	,	line.split(','		)		)		)
										if x * logaa(UpperCamelCase_		) > largest:
															SCREAMING_SNAKE_CASE__													= x * logaa(UpperCamelCase_		)
															SCREAMING_SNAKE_CASE__													= i + 1
					return result


if __name__ == "__main__":
				print(solution())





