input: Write a function to generate and print all prime numbers between 1 and a given number n.
  def generate_prime_numbers(n):
      prime_list = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (prime_list[p] == True):
              for i in range(p * 2, n + 1, p):
                  prime_list[i] = False
          p += 1
      for p in range(2, n):
          if prime_list[p]:
              print(p)
  
  assert generate_prime_numbers(10) == None
  # Output:
  # 2
  # 3
  # 5
  # 7
  assert generate_prime_numbers(20) == None
  # Output:
  # 2
  # 3
  # 5
  # 7
  # 11
  # 13
  # 17
  # 19
  assert generate_prime_numbers(1) == None
  # Output: (no output)
  assert generate_prime_numbers(-5) == None
  # Output: (no output)
output: def generate_prime_numbers(n):
      if n < 2:
          return
      prime_list = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (prime_list[p] == True):
              for i in range(p * 2, n + 1, p):
                  prime_list[i] = False
          p += 1
      for p in range(2, n):
          if prime_list[p]:
              print(p)