import math
def isPrime(x):
    if x <= 1:
        return False
    if x == 2:
        return True
    for i in range(2, int(math.ceil(x**0.5))+1):
        if x % i == 0:
            return False
    return True

n = input()
l = [input() for i in range(n)]
count = 0
for i in l:
    if isPrime(i):
        count += 1
print count import math math def isPrime(x):
    if x <= 1:
        return False
    if x == 2:
        return True
    for i in range(2, int(math.ceil(x**0.5))+1):
        if x % i == 0:
            return False
    return True isPrime if x <= 1:
        return False
     x <= 1 x 1 return False False if x == 2:
        return True
     x == 2 x 2 return True True for i in range(2, int(math.ceil(x**0.5))+1):
        if x % i == 0:
            return False
     i range(2, int(math.ceil(x**0.5))+1) range 2 int(math.ceil(x**0.5))+1 int(math.ceil(x**0.5)) int math.ceil(x**0.5) math.ceil math ceil x**0.5 x 0.5 1 if x % i == 0:
            return False
     x % i == 0 x % i x i 0 return False False return True True x x n = input() n input() input input() for i in range(n) for i in range(n) i range(n) range n for i in range(n) input() input l = [input() for i in range(n)] l [input() for i in range(n)] count = 0 count 0 for i in l:
    if isPrime(i):
        count += 1 i l if isPrime(i):
        count += 1 isPrime(i) isPrime i count += 1 count 1 print l = [input() for i in range(n)] [input() for i in range(n)] l count = 0 0 count n = input() input() n count += 1 1 count def isPrime(x):
    if x <= 1:
        return False
    if x == 2:
        return True
    for i in range(2, int(math.ceil(x**0.5))+1):
        if x % i == 0:
            return False
    return True def isPrime(x):
    if x <= 1:
        return False
    if x == 2:
        return True
    for i in range(2, int(math.ceil(x**0.5))+1):
        if x % i == 0:
            return False
    return True isPrime
import math
def isPrime(x):
    if x <= 1:
        return False
    if x == 2:
        return True
    for i in range(2, int(math.ceil(x**0.5))+1):
        if x % i == 0:
            return False
    return True

n = input()
l = [input() for i in range(n)]
count = 0
for i in l:
    if isPrime(i):
        count += 1
print count