


'''simple docstring'''



def       _UpperCamelCase (						UpperCamelCase__   ):
			if divisor % 5 == 0 or divisor % 2 == 0:
						return 0
			UpperCAmelCase__					:   Union[str, Any]       				=       1
			UpperCAmelCase__					:   Optional[int]       				=       1
			while repunit:
						UpperCAmelCase__					:   Optional[int]       				=       (1_0 * repunit + 1) % divisor
						repunit_index += 1
			return repunit_index







def       _UpperCamelCase (						UpperCamelCase__ = 1_0_0_0_0_0_0   ):
			UpperCAmelCase__					:   List[str]       				=       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       _UpperCamelCase (						UpperCamelCase__ = 4_0_0_0_0_0_0   ):
			UpperCAmelCase__					:   List[str]       				=       [0, 1]
			UpperCAmelCase__					:   Any       				=       0
			while fib[i] <= n:
						fib.append(fib[i] + fib[i + 1]   )
						if fib[i + 2] > n:
									break
						i += 1
			UpperCAmelCase__					:   str       				=       0
			for j in range(len(UpperCamelCase__   ) - 1   ):
						if fib[j] % 2 == 0:
									total += fib[j]

			return total


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