





def     lowerCamelCase__			(__lowerCamelCase	):

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

     _SCREAMING_SNAKE_CASE       :	Any						    =							[True] * (num + 1)

     _SCREAMING_SNAKE_CASE       :	Optional[int]						    =							2
     while p * p <= num:
          if primes[p]:
               for i in range(p * p,       num + 1,       __lowerCamelCase	):
                    _SCREAMING_SNAKE_CASE       :	str						    =							False
          p += 1

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


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       UpperCamelCase__      =int(input('Enter a positive integer: ').strip())
       print(prime_sieve_eratosthenes(user_num))






def     lowerCamelCase__			(__lowerCamelCase = 10**9	):
     _SCREAMING_SNAKE_CASE       :	List[str]						    =							1
     _SCREAMING_SNAKE_CASE       :	Any						    =							2

     _SCREAMING_SNAKE_CASE       :	List[Any]						    =							0
     _SCREAMING_SNAKE_CASE       :	Dict						    =							0
     _SCREAMING_SNAKE_CASE       :	Union[str, Any]						    =							0
     while perimeter <= max_perimeter:
          perimeters_sum += perimeter

          prev_value += 2 * value
          value += prev_value

          _SCREAMING_SNAKE_CASE       :	Tuple						    =							2 * value + 2 if i % 2 == 0 else 2 * value - 2
          i += 1

     return perimeters_sum


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