N = int(input())
ns = [int(input()) for _ in range(N)]

#primes = set()
#def is_prime(n):
#  if n in primes:
#    return True
#
#  for m in range(2, n):
#    if is_prime(m) and n % m == 0:
#      return False
#
#  primes.add(n)
#  return True

# Proof:
# if n < d ^ 2 and n mod d = 0;
# n = ad (a in N)
# ad < d ^ 2
# a < d
# QED

def is_prime(n):
  if n < 2: return False
  if n == 2: return True
  if n % 2 == 0: return False

  d = 3
  while d ** 2 <= n:
    if n % d == 0:
      return False
    d += 2
  return True

print(len([n for n in ns if is_prime(n)])) N = int(input()) N int(input()) int input() input int(input()) for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) int(input()) int input() input ns = [int(input()) for _ in range(N)] ns [int(input()) for _ in range(N)] def is_prime(n):
  if n < 2: return False
  if n == 2: return True
  if n % 2 == 0: return False

  d = 3
  while d ** 2 <= n:
    if n % d == 0:
      return False
    d += 2
  return True is_prime if n < 2: return False
   n < 2 n 2 if n == 2: return True
   n == 2 n 2 if n % 2 == 0: return False

   n % 2 == 0 n % 2 n 2 0 d = 3 d 3 while d ** 2 <= n:
    if n % d == 0:
      return False
    d += 2
   d ** 2 <= n d ** 2 d 2 n if n % d == 0:
      return False
     n % d == 0 n % d n d 0 return False False d += 2 d 2 return True True n n n for n in ns if is_prime(n) for n in ns if is_prime(n) n ns is_prime(n) is_prime n if is_prime(n) n print(len([n for n in ns if is_prime(n)])) print len([n for n in ns if is_prime(n)]) len [n for n in ns if is_prime(n)] ns = [int(input()) for _ in range(N)] [int(input()) for _ in range(N)] ns N = int(input()) int(input()) N def is_prime(n):
  if n < 2: return False
  if n == 2: return True
  if n % 2 == 0: return False

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

  d = 3
  while d ** 2 <= n:
    if n % d == 0:
      return False
    d += 2
  return True is_prime
N = int(input())
ns = [int(input()) for _ in range(N)]

#primes = set()
#def is_prime(n):
#  if n in primes:
#    return True
#
#  for m in range(2, n):
#    if is_prime(m) and n % m == 0:
#      return False
#
#  primes.add(n)
#  return True

# Proof:
# if n < d ^ 2 and n mod d = 0;
# n = ad (a in N)
# ad < d ^ 2
# a < d
# QED

def is_prime(n):
  if n < 2: return False
  if n == 2: return True
  if n % 2 == 0: return False

  d = 3
  while d ** 2 <= n:
    if n % d == 0:
      return False
    d += 2
  return True

print(len([n for n in ns if is_prime(n)]))