



def     __a					(		__UpperCAmelCase       ):
 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     __a					(		__UpperCAmelCase = 100_0000       ):
 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() = }')










a_      :      str    =     6_55_21






def     __a					(		__UpperCAmelCase       ):
 a__												= 1
 a__												= 0
 for plain_chr in plain_text:
  a__												= (a + ord(__UpperCAmelCase       )) % MOD_ADLER
  a__												= (b + a) % MOD_ADLER
 return (b << 16) | a





