

'''simple docstring'''







def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			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       UpperCAmelCase__    (      UpperCAmelCase__ = 1_00_00_00				)			->			int:
       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       UpperCAmelCase__    (      UpperCAmelCase__,       UpperCAmelCase__,       UpperCAmelCase__ = 0,       UpperCAmelCase__ = 0				)			->			int:
       A_						=      right or len(UpperCAmelCase__				) - 1
       if left > right:
              return -1
       elif list_data[left] == key:
              return left
       elif list_data[right] == key:
              return right
       else:
              return search(UpperCAmelCase__,       UpperCAmelCase__,       left + 1,       right - 1				)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
