





'''simple docstring'''

def 						UpperCamelCase    (							_lowerCamelCase : 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    (							_lowerCamelCase : int = 1_00_00_00	):
    A__    =      limit - 1
    if divisor % 2 == 0:
        divisor += 1
    while least_divisible_repunit(_lowerCamelCase	) <= limit:
        divisor += 2
    return divisor


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










'''simple docstring'''

def 						UpperCamelCase    (							):
    A__    =      [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

    A__    =      6
    A__    =      1
    A__    =      19_01

    A__    =      0

    while year < 20_01:
        day += 7

        if (year % 4 == 0 and year % 1_00 != 0) or (year % 4_00 == 0):
            if day > days_per_month[month - 1] and month != 2:
                month += 1
                A__    =      day - days_per_month[month - 2]
            elif day > 29 and month == 2:
                month += 1
                A__    =      day - 29
        else:
            if day > days_per_month[month - 1]:
                month += 1
                A__    =      day - days_per_month[month - 2]

        if month > 12:
            year += 1
            A__    =      1

        if year < 20_01 and day == 1:
            sundays += 1
    return sundays


if __name__ == "__main__":
  print(solution())



