def prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

n = int(input())
c = 0
for _ in range(n):
    s = int(input())
    if prime(s):
        c+=1

print(c) def prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True prime for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
     i range(2, int(n**0.5) + 1) range 2 int(n**0.5) + 1 int(n**0.5) int n**0.5 n 0.5 1 if n % i == 0:
            return False
     n % i == 0 n % i n i 0 return False False return True True n n n = int(input()) n int(input()) int input() input c = 0 c 0 for _ in range(n):
    s = int(input())
    if prime(s):
        c+=1 _ range(n) range n s = int(input()) s int(input()) int input() input if prime(s):
        c+=1 prime(s) prime s c+=1 c 1 print(c) print c c = 0 0 c n = int(input()) int(input()) n def prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True def prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True prime s = int(input()) int(input()) s c+=1 1 c
def prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

n = int(input())
c = 0
for _ in range(n):
    s = int(input())
    if prime(s):
        c+=1

print(c)