input: Write a python function to print prime numbers from a given list.
  assert printPrime([2, 3, 5, 6, 5, 7, 8, 1, 6]) == [2, 3, 5, 5, 7]
  assert printPrime([10, 11, 12, 13, 14, 15, 16, 17, 18, 19]) == [11, 13, 17, 19]
  assert printPrime([20, 21, 22, 23, 24, 25, 26, 27, 28, 29]) == [23, 29]
output: def printPrime(numbers):
      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 [num for num in numbers if is_prime(num)]