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 __future__ import annotations

import numpy as np
def 							lowerCAmelCase(     __lowerCamelCase						):
					return np.maximum(0				,    __lowerCamelCase						)


if __name__ == "__main__":
	print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]




