def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1

num = []
prime_numbers = []

n = int(input())

for _ in range(n):
    i = int(input())
    num.append(i)

for i in num:
    if is_prime(i):
        prime_numbers.append(i)

print(len(prime_numbers)) def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1 is_prime q = abs(q) q abs(q) abs q if q == 2: return True
     q == 2 q 2 if q < 2 or q&1 == 0: return False
     q < 2 or q&1 == 0 q < 2 q 2 q&1 == 0 q&1 q 1 0 return pow(2, q-1, q) == 1 pow(2, q-1, q) == 1 pow(2, q-1, q) pow 2 q-1 q 1 q 1 q q num = [] num [] prime_numbers = [] prime_numbers [] n = int(input()) n int(input()) int input() input for _ in range(n):
    i = int(input())
    num.append(i) _ range(n) range n i = int(input()) i int(input()) int input() input num.append(i) num.append num append i for i in num:
    if is_prime(i):
        prime_numbers.append(i) i num if is_prime(i):
        prime_numbers.append(i) is_prime(i) is_prime i prime_numbers.append(i) prime_numbers.append prime_numbers append i print(len(prime_numbers)) print len(prime_numbers) len prime_numbers i = int(input()) int(input()) i prime_numbers = [] [] prime_numbers n = int(input()) int(input()) n def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1 def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1 is_prime num = [] [] num
def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1

num = []
prime_numbers = []

n = int(input())

for _ in range(n):
    i = int(input())
    num.append(i)

for i in num:
    if is_prime(i):
        prime_numbers.append(i)

print(len(prime_numbers))