#ALDS1_1-C Prime Numbers
def prime(n):
    s=3
    while(s*s <= n):
        if(n%s==0):
            return False
        s+=2
    return True

n=int(input())
num=0
for i in range(n):
    x = int(input())
    if prime(x) and x%2!=0:
        num+=1
    if x==2:
        num+=1
print(num) def prime(n):
    s=3
    while(s*s <= n):
        if(n%s==0):
            return False
        s+=2
    return True prime s=3 s 3 while(s*s <= n):
        if(n%s==0):
            return False
        s+=2
     s*s <= n s*s s s n if(n%s==0):
            return False
         n%s==0 n%s n s 0 return False False s+=2 s 2 return True True n n n=int(input()) n int(input()) int input() input num=0 num 0 for i in range(n):
    x = int(input())
    if prime(x) and x%2!=0:
        num+=1
    if x==2:
        num+=1 i range(n) range n x = int(input()) x int(input()) int input() input if prime(x) and x%2!=0:
        num+=1
     prime(x) and x%2!=0 prime(x) prime x x%2!=0 x%2 x 2 0 num+=1 num 1 if x==2:
        num+=1 x==2 x 2 num+=1 num 1 print(num) print num num=0 0 num num+=1 1 num n=int(input()) int(input()) n x = int(input()) int(input()) x def prime(n):
    s=3
    while(s*s <= n):
        if(n%s==0):
            return False
        s+=2
    return True def prime(n):
    s=3
    while(s*s <= n):
        if(n%s==0):
            return False
        s+=2
    return True prime num+=1 1 num
#ALDS1_1-C Prime Numbers
def prime(n):
    s=3
    while(s*s <= n):
        if(n%s==0):
            return False
        s+=2
    return True

n=int(input())
num=0
for i in range(n):
    x = int(input())
    if prime(x) and x%2!=0:
        num+=1
    if x==2:
        num+=1
print(num)