input: Write a function to print out the first n prime numbers using the Sieve of Eratosthenes method. The function should take an integer n as an input, and output a list of the first n prime numbers.
  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]
  assert sieve_of_eratosthenes(0) == []
  assert sieve_of_eratosthenes(1) == [2]
output: def sieve_of_eratosthenes(n):
      if n == 0:
          return []
      if n == 1:
          return [2]
      
      limit = 2
      primes = []
      while len(primes) < n:
          limit *= 2
          sieve = [True] * limit
          sieve[0] = sieve[1] = False
          
          for start in range(2, limit):
              if sieve[start]:
                  primes.append(start)
                  if len(primes) == n:
                      break
                  for i in range(start*start, limit, start):
                      sieve[i] = False
      
      return primes[:n]