





def    A_(			A   ):

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

	UpperCAmelCase_								=     [True] * (num + 1)

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

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


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				UpperCamelCase__   : Optional[Any]					  = int(input("""Enter a positive integer: """).strip())
				print(prime_sieve_eratosthenes(user_num))









from __future__ import annotations




def    A_(			A   ):
	if not nums:
		raise ValueError("""List is empty"""   )
	return sum(A   ) / len(A   )


if __name__ == "__main__":
				import doctest

				doctest.testmod()


