


class       _UpperCamelCase    :

    """simple docstring"""







    def __init__(						self				,   a__   )	->				str:
     A								=				n
     A								=				[None] * self.n
     A								=				0  # index of the first element
     A								=				0
     A								=				0

    def __len__(						self   )	->				int:
     return self.size

    def      _UpperCAmelCase					(						self   )	->				Optional[int]:
     return self.size == 0

    def      _UpperCAmelCase					(						self   )	->				Union[str, Any]:
     return False if self.is_empty() else self.array[self.front]

    def      _UpperCAmelCase					(						self				,   a__   )	->				Any:
     if self.size >= self.n:
      raise Exception("""QUEUE IS FULL"""   )

     A								=				data
     A								=				(self.rear + 1) % self.n
     self.size += 1
     return self

    def      _UpperCAmelCase					(						self   )	->				Optional[int]:
     if self.size == 0:
      raise Exception("""UNDERFLOW"""   )

     A								=				self.array[self.front]
     A								=				None
     A								=				(self.front + 1) % self.n
     self.size -= 1
     return temp







def   _lowerCAmelCase				(   UpperCamelCase__:     int						) ->   list[int]:





	"""simple docstring"""







	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							,					UpperCamelCase__						):
				A								=				False
		p += 1

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


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				_lowercase       :      Tuple	=	int(input("Enter a positive integer: ").strip())
				print(prime_sieve_eratosthenes(user_num))



