


"""simple docstring"""


def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





		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       (   UpperCamelCase__ = 1000000	)      ->		int:







		"""simple docstring"""





		A					       = limit - 1
		if divisor % 2 == 0:
				divisor += 1
		while least_divisible_repunit(UpperCamelCase__	) <= limit:
				divisor += 2
		return divisor


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









"""simple docstring"""


def  __snake_case       (   UpperCamelCase__ ,			UpperCamelCase__ = " "	)      ->		list:







		"""simple docstring"""





		A					       = []

		A					       = 0
		for index, char in enumerate(UpperCamelCase__	):
				if char == separator:
						split_words.append(string[last_index:index]	)
						A					       = index + 1
				elif index + 1 == len(UpperCamelCase__	):
						split_words.append(string[last_index : index + 1]	)
		return split_words


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

	testmod()





