
n = int(input())

def isPrime(x):
    if x < 2:
        return false
    if x == 2:
        return True
    return pow(2, x-1, x) == 1

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

prime = 0
for i in s:
    if isPrime(i):
        prime += 1
print(prime) n = int(input()) n int(input()) int input() input def isPrime(x):
    if x < 2:
        return false
    if x == 2:
        return True
    return pow(2, x-1, x) == 1 isPrime if x < 2:
        return false
     x < 2 x 2 return false false if x == 2:
        return True
     x == 2 x 2 return True True return pow(2, x-1, x) == 1 pow(2, x-1, x) == 1 pow(2, x-1, x) pow 2 x-1 x 1 x 1 x x s = [] s [] for i in range(n):
    s.append(int(input())) i range(n) range n s.append(int(input())) s.append s append int(input()) int input() input prime = 0 prime 0 for i in s:
    if isPrime(i):
        prime += 1 i s if isPrime(i):
        prime += 1 isPrime(i) isPrime i prime += 1 prime 1 print(prime) print prime prime += 1 1 prime s = [] [] s n = int(input()) int(input()) n prime = 0 0 prime def isPrime(x):
    if x < 2:
        return false
    if x == 2:
        return True
    return pow(2, x-1, x) == 1 def isPrime(x):
    if x < 2:
        return false
    if x == 2:
        return True
    return pow(2, x-1, x) == 1 isPrime

n = int(input())

def isPrime(x):
    if x < 2:
        return false
    if x == 2:
        return True
    return pow(2, x-1, x) == 1

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

prime = 0
for i in s:
    if isPrime(i):
        prime += 1
print(prime)