
'''simple docstring'''
from __future__ import annotations

import math






def      UpperCamelCase_				(      A__						):

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

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

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

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

		start += 1

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

	return prime


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


'''simple docstring'''
from __future__ import annotations






def      UpperCamelCase_				(      A__						):
	a_      				=						[True] * limit
	a_      				=						False
	a_      				=						False
	a_      				=						True

	for i in range(3  ,      int(limit**0.5 + 1						)  ,      2						):
		a_      				=						i * 2
		while index < limit:
			a_      				=						False
			a_      				=						index + i

	a_      				=						[2]

	for i in range(3  ,      A__  ,      2						):
		if is_prime[i]:
			primes.append(A__						)

	return primes






def      UpperCamelCase_				(      A__ = 1_00_00_00						):
	a_      				=						prime_sieve(A__						)
	a_      				=						0
	a_      				=						0

	for i in range(len(A__						)						):
		for j in range(i + length  ,      len(A__						)						):
			a_      				=						sum(primes[i:j]						)
			if sol >= ceiling:
				break

			if sol in primes:
				a_      				=						j - i
				a_      				=						sol

	return largest


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