[BOJ] 소수 찾기

N = int(input())
num = list(map(int, input().split()))
count = 0

for i in num:
    flag = 0
    if i == 1:
        continue
    for j in range(2, i):
        if i % j == 0:
            flag = 1
            break
    if flag == 0:
        count += 1

print(count)