old_contents: import sieve
  
  
  def prime_factors(n):
      primes = sieve.sieve(n)
      factors = []
      for p in primes:
          while n % p == 0:
              factors += [p]
              n //= p
      return factors
  
new_contents: def prime_factors(n):
      factors = []
      factor = 2
      while n != 1:
          while n % factor == 0:
              factors += [factor]
              n //= factor
          factor += 1
      return factors
  
subject: Fix memory issues by just trying every number