input: Write a python function to filter prime numbers from a list.
  assert primes([2, 3, 4, 5, 6, 7, 8, 9, 10]) == [2, 3, 5, 7]
  assert primes([11, 12, 13, 14, 15, 16, 17, 18, 19, 20]) == [11, 13, 17, 19]
  assert primes([1, 2, 3, 5, 8, 13, 21, 34, 55, 89]) == [2, 3, 5, 13, 89]
output: def primes(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      return [x for x in lst if is_prime(x)]