
"""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() = }""")

"""simple docstring"""


from maths.prime_check import is_prime






def    _snake_case					(		snake_case__ :  int  ):
	if not isinstance(snake_case__						,   snake_case__  ):
		A     = F'Input value of [number={number}] must be an integer'
		raise TypeError(snake_case__  )
	if is_prime(snake_case__  ) and is_prime(number + 2  ):
		return number + 2
	else:
		return -1


if __name__ == "__main__":
		import doctest

		doctest.testmod()