





'''simple docstring'''






def 							_lowerCamelCase(  UpperCamelCase__    : int		)		->  int:
    if divisor % 5 == 0 or divisor % 2 == 0:
        return 0
    A       :       Optional[int]							=						1
    A       :       Optional[int]							=						1
    while repunit:
        A       :       str							=						(10 * repunit + 1) % divisor
        repunit_index += 1
    return repunit_index
def 							_lowerCamelCase(  UpperCamelCase__    : int = 1_000_000		)		->  int:
    A       :       Dict							=						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'''






from __future__ import annotations

import math
def 							_lowerCamelCase(  UpperCamelCase__    : int		)		->  list[int]:

    if num <= 0:
        A       :       str							=						F'''{num}: Invalid input, please enter a positive integer.'''
        raise ValueError(UpperCamelCase__		)

    A       :       int							=						[True] * (num + 1)
    A       :       Dict							=						[]
    A       :       str							=						2
    A       :       Any							=						int(math.sqrt(UpperCamelCase__		)		)

    while start <= end:
        # If start is a prime
        if sieve[start] is True:
            prime.append(UpperCamelCase__		)

            # Set multiples of start be False
            for i in range(start * start    ,       num + 1    ,       UpperCamelCase__		):
                if sieve[i] is True:
                    A       :       Union[str, Any]							=						False

        start += 1

    for j in range(end + 1    ,       num + 1		):
        if sieve[j] is True:
            prime.append(UpperCamelCase__		)

    return prime


if __name__ == "__main__":
     print(prime_sieve(int(input("""Enter a positive integer: """).strip())))
