
N=int(raw_input())
s=[int(raw_input()) for x in range(N)]


def is_prime(n):
  i = 2
  while i * i <=n:
    if n % i == 0:
      return False
    i += 1
  return True

a=filter(is_prime,s)
print len(a) N=int(raw_input()) N int(raw_input()) int raw_input() raw_input int(raw_input()) for x in range(N) for x in range(N) x range(N) range N for x in range(N) int(raw_input()) int raw_input() raw_input s=[int(raw_input()) for x in range(N)] s [int(raw_input()) for x in range(N)] def is_prime(n):
  i = 2
  while i * i <=n:
    if n % i == 0:
      return False
    i += 1
  return True is_prime i = 2 i 2 while i * i <=n:
    if n % i == 0:
      return False
    i += 1
   i * i <=n i * i i i n if n % i == 0:
      return False
     n % i == 0 n % i n i 0 return False False i += 1 i 1 return True True n n a=filter(is_prime,s) a filter(is_prime,s) filter is_prime s print len(a) len a N=int(raw_input()) int(raw_input()) N s=[int(raw_input()) for x in range(N)] [int(raw_input()) for x in range(N)] s def is_prime(n):
  i = 2
  while i * i <=n:
    if n % i == 0:
      return False
    i += 1
  return True def is_prime(n):
  i = 2
  while i * i <=n:
    if n % i == 0:
      return False
    i += 1
  return True is_prime a=filter(is_prime,s) filter(is_prime,s) a

N=int(raw_input())
s=[int(raw_input()) for x in range(N)]


def is_prime(n):
  i = 2
  while i * i <=n:
    if n % i == 0:
      return False
    i += 1
  return True

a=filter(is_prime,s)
print len(a)