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

n = int(input())
data = []
[data.append(int(input())) for i in range(n)]

check = [is_prime(d) for d in data]
print(sum(check)) 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 n = int(input()) n int(input()) int input() input data = [] data [] data.append(int(input())) for i in range(n) for i in range(n) i range(n) range n for i in range(n) data.append(int(input())) data.append data append int(input()) int input() input [data.append(int(input())) for i in range(n)] is_prime(d) for d in data for d in data d data for d in data is_prime(d) is_prime d check = [is_prime(d) for d in data] check [is_prime(d) for d in data] print(sum(check)) print sum(check) sum check 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 n = int(input()) int(input()) n data = [] [] data check = [is_prime(d) for d in data] [is_prime(d) for d in data] check
def is_prime(n): 
  i = 2
  while i * i <=n:
    if n % i == 0:
      return False
    i += 1
  return True

n = int(input())
data = []
[data.append(int(input())) for i in range(n)]

check = [is_prime(d) for d in data]
print(sum(check))