input: Write a function to print all prime numbers between 1 and a given number n.
  assert generate_prime_numbers(10)==None
  assert generate_prime_numbers(20)==None
  assert generate_prime_numbers(5)==None
  assert generate_prime_numbers(1)==None
  assert generate_prime_numbers(0)==None
output: def generate_prime_numbers(n):
      if n < 2:
          return
      for num in range(2, n + 1):
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  break
          else:
              print(num)