input: Write a function to find the largest prime factor of a given number. Return the largest prime factor. If the input number is 0 or 1, return 1.
  def largest_prime_factor(n):
      if n <= 1:
          return 1
      factors = []
      for i in range(2, int(math.sqrt(n)) + 1):
          if n % i == 0:
              factors.append(i)
              factors.append(int(n/i))
      prime_factors = []
      for potential_factor in factors:
          is_prime = True
          for j in range(2,int(math.sqrt(potential_factor))+1):
              if potential_factor % j == 0 and potential_factor != j: 
                  is_prime = False
          if is_prime:
              prime_factors.append(potential_factor)
      return max(prime_factors) if prime_factors else n
  
  assert largest_prime_factor(331) == 331
  assert largest_prime_factor(13195) == 29
  assert largest_prime_factor(600851475143) == 6857
  assert largest_prime_factor(0) == 1
  assert largest_prime_factor(1) == 1
output: def largest_prime_factor(n):
      if n <= 1:
          return 1
      factors = []
      for i in range(2, int(math.sqrt(n)) + 1):
          if n % i == 0:
              factors.append(i)
              factors.append(int(n/i))
      prime_factors = []
      for potential_factor in factors:
          is_prime = True
          for j in range(2,int(math.sqrt(potential_factor))+1):
              if potential_factor % j == 0 and potential_factor != j: 
                  is_prime = False
          if is_prime:
              prime_factors.append(potential_factor)
      return max(prime_factors) if prime_factors else n