input: Write a python function to filter prime numbers from a list.
  assert filter_prime_numbers([2, 3, 4, 5, 6, 7, 8, 9, 10]) == [2, 3, 5, 7]
  assert filter_prime_numbers([11, 13, 17, 19, 23, 29, 31]) == [11, 13, 17, 19, 23, 29, 31]
  assert filter_prime_numbers([1, 2, 4, 6, 8, 10, 12]) == [2]
output: def filter_prime_numbers(numbers):
      def is_prime(n):
          if n <= 1:
              return False
          if n <= 3:
              return True
          if n % 2 == 0 or n % 3 == 0:
              return False
          i = 5
          while (i * i) <= n:
              if n % i == 0 or n % (i + 2) == 0:
                  return False
              i += 6
          return True
  
      return [num for num in numbers if is_prime(num)]