






"""simple docstring"""

def _lowerCAmelCase	(  __lowerCamelCase:int   ):

						'''simple docstring'''






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

						__magic_name__            =     [True] * (num + 1)

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

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


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			lowercase    			=       int(input('''Enter a positive integer: ''').strip())
			print(prime_sieve_eratosthenes(user_num))











"""simple docstring"""

def _lowerCAmelCase	(  __lowerCamelCase:int = 2_0_0_0_0_0_0   ):

						'''simple docstring'''






						__magic_name__            =     [0 for i in range(n + 1   )]
						__magic_name__            =     1
						__magic_name__            =     1

						for i in range(2 ,						int(n**0.5   ) + 1   ):
												if primality_list[i] == 0:
																		for j in range(i * i ,						n + 1 ,						__lowerCamelCase   ):
																								__magic_name__            =     1
						__magic_name__            =     0
						for i in range(__lowerCamelCase   ):
												if primality_list[i] == 0:
																		sum_of_primes += i
						return sum_of_primes


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



