
"""simple docstring"""


def    _snake_case					(		snake_case__ :  int  ):
	if divisor % 5 == 0 or divisor % 2 == 0:
		return 0
	A     = 1
	A     = 1
	while repunit:
		A     = (10 * repunit + 1) % divisor
		repunit_index += 1
	return repunit_index






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


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

def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int = 10**9)   ->       int:






							'''simple docstring'''





							__UpperCamelCase      :  int       =   1
							__UpperCamelCase      :  Any       =   2

							__UpperCamelCase      :  Dict       =   0
							__UpperCamelCase      :  Any       =   0
							__UpperCamelCase      :  List[Any]       =   0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

														__UpperCamelCase      :  Optional[int]       =   2 * value + 2 if i % 2 == 0 else 2 * value - 2
														i += 1

							return perimeters_sum


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