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