def is_prime(num):
    i = 2
    while i*i <= num:
        if num % i == 0:
            return False
        i = i + 1
    return True

N = int(input())
cnt = 0
for i in range(0, N):
    n = int(input())
    if (is_prime(n)):
        cnt = cnt + 1
        
print(cnt) def is_prime(num):
    i = 2
    while i*i <= num:
        if num % i == 0:
            return False
        i = i + 1
    return True is_prime i = 2 i 2 while i*i <= num:
        if num % i == 0:
            return False
        i = i + 1
     i*i <= num i*i i i num if num % i == 0:
            return False
         num % i == 0 num % i num i 0 return False False i = i + 1 i i + 1 i 1 return True True num num N = int(input()) N int(input()) int input() input cnt = 0 cnt 0 for i in range(0, N):
    n = int(input())
    if (is_prime(n)):
        cnt = cnt + 1
         i range(0, N) range 0 N n = int(input()) n int(input()) int input() input if (is_prime(n)):
        cnt = cnt + 1
         is_prime(n) is_prime n cnt = cnt + 1 cnt cnt + 1 cnt 1 print(cnt) print cnt N = int(input()) int(input()) N cnt = cnt + 1 cnt + 1 cnt cnt = 0 0 cnt n = int(input()) int(input()) n def is_prime(num):
    i = 2
    while i*i <= num:
        if num % i == 0:
            return False
        i = i + 1
    return True def is_prime(num):
    i = 2
    while i*i <= num:
        if num % i == 0:
            return False
        i = i + 1
    return True is_prime
def is_prime(num):
    i = 2
    while i*i <= num:
        if num % i == 0:
            return False
        i = i + 1
    return True

N = int(input())
cnt = 0
for i in range(0, N):
    n = int(input())
    if (is_prime(n)):
        cnt = cnt + 1
        
print(cnt)