

'''simple docstring'''
def  _A		(     snake_case					)      ->     int:
   if divisor % 5 == 0 or divisor % 2 == 0:
      return 0
   _lowercase      :				Any      					=       1
   _lowercase      :				str      					=       1
   while repunit:
      _lowercase      :				Tuple      					=       (10 * repunit + 1) % divisor
      repunit_index += 1
   return repunit_index







def  _A		(     snake_case = 1_00_00_00					)      ->     int:
   _lowercase      :				Optional[int]      					=       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'''
def  _A		(     snake_case		,							snake_case					)      ->     int:
   return int((input_a, input_a).count(0					) != 0					)







def  _A		(     )      ->     None:
   assert nand_gate(0		,							0					) == 1
   assert nand_gate(0		,							1					) == 1
   assert nand_gate(1		,							0					) == 1
   assert nand_gate(1		,							1					) == 0


if __name__ == "__main__":
    print(nand_gate(0, 0))
    print(nand_gate(0, 1))
    print(nand_gate(1, 0))
    print(nand_gate(1, 1))






