input: Write a function to print out the first n prime numbers.
  
  def print_first_n_primes(n):
      def sieve_of_eratosthenes(n):
          primes = [True] * (n+1)
          primes[0] = primes[1] = False
          for i in range(2, int(n**0.5)+1):
              if primes[i]:
                  for j in range(i*i, n+1, i):
                      primes[j] = False
  
          prime_numbers = []
          for i in range(len(primes)):
              if primes[i]:
                  prime_numbers.append(i) 
          return prime_numbers
      
      primes = sieve_of_eratosthenes(n*10)
      print(primes[:n])
  
  print_first_n_primes(10)
  print_first_n_primes(5)
  print_first_n_primes(20)
  print_first_n_primes(1)
  print_first_n_primes(0)
output: def print_first_n_primes(n):
      def sieve_of_eratosthenes(n):
          primes = [True] * (n+1)
          primes[0] = primes[1] = False
          for i in range(2, int(n**0.5)+1):
              if primes[i]:
                  for j in range(i*i, n+1, i):
                      primes[j] = False
  
          prime_numbers = []
          for i in range(len(primes)):
              if primes[i]:
                  prime_numbers.append(i) 
          return prime_numbers
      
      primes = sieve_of_eratosthenes(n*10)
      print(primes[:n])