input: Write a function to print out the first n prime numbers using the Sieve of Eratosthenes algorithm. The function should return the list of the first n prime numbers. For n = 0, return an empty list.
  def sieve_of_eratosthenes(n):
      if n == 0:
          return []
      limit = n * 20
      primes = [True] * (limit + 1)
      primes[0] = primes[1] = False
      for i in range(2, int(limit**0.5) + 1):
          if primes[i]:
              for j in range(i * i, limit + 1, i):
                  primes[j] = False
      prime_numbers = [i for i, is_prime in enumerate(primes) if is_prime][:n]
      return prime_numbers
  
  assert sieve_of_eratosthenes(0) == []
  assert sieve_of_eratosthenes(1) == [2]
  assert sieve_of_eratosthenes(5) == [2, 3, 5, 7, 11]
  assert sieve_of_eratosthenes(10) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
output: def sieve_of_eratosthenes(n):
      if n == 0:
          return []
      limit = n * 20
      primes = [True] * (limit + 1)
      primes[0] = primes[1] = False
      for i in range(2, int(limit**0.5) + 1):
          if primes[i]:
              for j in range(i * i, limit + 1, i):
                  primes[j] = False
      prime_numbers = [i for i, is_prime in enumerate(primes) if is_prime][:n]
      return prime_numbers