input: def generate_prime_numbers(n: int) -> None:
      """ Generates a sequence of prime numbers up to a given number n using the Sieve of Eratosthenes.
      >>> generate_prime_numbers(10)
      2
      3
      5
      7
      """
output:     if n < 2:
          return
      is_prime = [True] * (n + 1)
      p = 2
      while (p * p <= n):
          if (is_prime[p] == True):
              for i in range(p * p, n + 1, p):
                  is_prime[i] = False
          p += 1
      for p in range(2, n + 1):
          if is_prime[p]:
              print(p)