def is_prime(n):
  if n < 2: return False
  for i in range(2, int(n ** 0.5) + 1):
    if n % i == 0: return False
  return True

count = 0
for i in range(int(input())):
  if is_prime(int(input())) : count += 1
print(count) def is_prime(n):
  if n < 2: return False
  for i in range(2, int(n ** 0.5) + 1):
    if n % i == 0: return False
  return True is_prime if n < 2: return False
   n < 2 n 2 for i in range(2, int(n ** 0.5) + 1):
    if n % i == 0: return False
   i range(2, int(n ** 0.5) + 1) range 2 int(n ** 0.5) + 1 int(n ** 0.5) int n ** 0.5 n 0.5 1 if n % i == 0: return False
   n % i == 0 n % i n i 0 return True True n n count = 0 count 0 for i in range(int(input())):
  if is_prime(int(input())) : count += 1 i range(int(input())) range int(input()) int input() input if is_prime(int(input())) : count += is_prime(int(input())) is_prime int(input()) int input() input print(count) print count def is_prime(n):
  if n < 2: return False
  for i in range(2, int(n ** 0.5) + 1):
    if n % i == 0: return False
  return True def is_prime(n):
  if n < 2: return False
  for i in range(2, int(n ** 0.5) + 1):
    if n % i == 0: return False
  return True is_prime count = 0 0 count
def is_prime(n):
  if n < 2: return False
  for i in range(2, int(n ** 0.5) + 1):
    if n % i == 0: return False
  return True

count = 0
for i in range(int(input())):
  if is_prime(int(input())) : count += 1
print(count)