def 							lowerCAmelCase(     __lowerCamelCase						):

					if num <= 0:
										raise ValueError('Input must be a positive integer'						)

					__a		 =       [True] * (num + 1)

					__a		 =       2
					while p * p <= num:
										if primes[p]:
															for i in range(p * p				,    num + 1				,    __lowerCamelCase						):
																				__a		 =       False
										p += 1

					return [prime for prime in range(2				,    num + 1						) if primes[prime]]


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	lowerCamelCase_    :		Dict							=	int(input("""Enter a positive integer: """).strip())
	print(prime_sieve_eratosthenes(user_num))





from math import sqrt
def 							lowerCAmelCase(     __lowerCamelCase						):
					__a		 =       0
					for i in range(1				,    int(sqrt(__lowerCamelCase						) + 1						)						):
										if n % i == 0 and i != sqrt(__lowerCamelCase						):
															total += i + n // i
										elif i == sqrt(__lowerCamelCase						):
															total += i
					return total - n
def 							lowerCAmelCase(     __lowerCamelCase = 1_0000						):
					__a		 =       sum(
					    i
					    for i in range(1				,    __lowerCamelCase						)
					    if sum_of_divisors(sum_of_divisors(__lowerCamelCase						)						) == i and sum_of_divisors(__lowerCamelCase						) != i						)
					return total


if __name__ == "__main__":
	print(solution(int(str(input()).strip())))




