from __future__ import annotations

import math





def  _lowerCamelCase					(   a_				: int):

			if num <= 0:
						lowerCamelCase						:Union[str, Any]						  =     F"{num}: Invalid input, please enter a positive integer."
						raise ValueError(a_)

			lowerCamelCase						:Any						  =     [True] * (num + 1)
			lowerCamelCase						:Union[str, Any]						  =     []
			lowerCamelCase						:List[Any]						  =     2
			lowerCamelCase						:Dict						  =     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:
															lowerCamelCase						:Optional[int]						  =     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())))




def  _lowerCamelCase					(   a_				: str						,			a_				: str):
			lowerCamelCase						:List[str]						  =     len(a_)
			lowerCamelCase						:List[str]						  =     len(a_)
			lowerCamelCase						:int						  =     [[False for _ in range(m + 1)] for _ in range(n + 1)]
			lowerCamelCase						:Optional[Any]						  =     True
			for i in range(a_):
						for j in range(m + 1):
									if dp[i][j]:
												if j < m and a[i].upper() == b[j]:
															lowerCamelCase						:Any						  =     True
												if a[i].islower():
															lowerCamelCase						:List[str]						  =     True
			return dp[n][m]


if __name__ == "__main__":
			import doctest

			doctest.testmod()



