




def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE   ):
			'''simple docstring'''
			if divisor % 5 == 0 or divisor % 2 == 0:
						return 0
			SCREAMING_SNAKE_CASE           =					1
			SCREAMING_SNAKE_CASE           =					1
			while repunit:
						SCREAMING_SNAKE_CASE           =					(10 * repunit + 1) % divisor
						repunit_index += 1
			return repunit_index
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE = 1_00_00_00   ):
			'''simple docstring'''
			SCREAMING_SNAKE_CASE           =					limit - 1
			if divisor % 2 == 0:
						divisor += 1
			while least_divisible_repunit(SCREAMING_SNAKE_CASE   ) <= limit:
						divisor += 2
			return divisor


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







from __future__ import annotations

import math
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE   ):
			'''simple docstring'''

			if num <= 0:
						SCREAMING_SNAKE_CASE           =					f"""{num}: Invalid input, please enter a positive integer."""
						raise ValueError(SCREAMING_SNAKE_CASE   )

			SCREAMING_SNAKE_CASE           =					[True] * (num + 1)
			SCREAMING_SNAKE_CASE           =					[]
			SCREAMING_SNAKE_CASE           =					2
			SCREAMING_SNAKE_CASE           =					int(math.sqrt(SCREAMING_SNAKE_CASE   )   )

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

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

						start += 1

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

			return prime


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






