
'''simple docstring'''
def 		A_(     A						:		int):
							if divisor % 5 == 0 or divisor % 2 == 0:
														return 0
							UpperCamelCase   			=     1
							UpperCamelCase   			=     1
							while repunit:
														UpperCamelCase   			=     (10 * repunit + 1) % divisor
														repunit_index += 1
							return repunit_index







def 		A_(     A						:		int = 100_0000):
							UpperCamelCase   			=     limit - 1
							if divisor % 2 == 0:
														divisor += 1
							while least_divisible_repunit(A) <= limit:
														divisor += 2
							return divisor


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












"""simple docstring"""
from __future__ import annotations






def       __UpperCamelCase						(		snake_case__ , snake_case__ = None , snake_case__ = None       ):
	if start is None:
		A_		:    Dict						     = 0

	if end is None:
		A_		:    Dict						     = len(snake_case__       ) - 1

	if start >= end:
		return

	A_		:    List[Any]						     = (start + end) // 2

	slowsort(snake_case__ , snake_case__ , snake_case__       )
	slowsort(snake_case__ , mid + 1 , snake_case__       )

	if sequence[end] < sequence[mid]:
		A_     ,  A_		:    Dict						     = sequence[mid], sequence[end]

	slowsort(snake_case__ , snake_case__ , end - 1       )


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

							testmod()

