def primeq(x):
    if x==1:return False
    for i in range(2,int(x**.5)+1):
        if x%i==0:return False
    return True

c=0
for i in range(int(input())):
    if primeq(int(input())):c+=1
print(c) def primeq(x):
    if x==1:return False
    for i in range(2,int(x**.5)+1):
        if x%i==0:return False
    return True primeq if x==1:return False
     x==1 x 1 for i in range(2,int(x**.5)+1):
        if x%i==0:return False
     i range(2,int(x**.5)+1) range 2 int(x**.5)+1 int(x**.5) int x**.5 x .5 1 if x%i==0:return False
     x%i==0 x%i x i 0 return True True x x c=0 c 0 for i in range(int(input())):
    if primeq(int(input())):c+=1 i range(int(input())) range int(input()) int input() input if primeq(int(input())): primeq(int(input())) primeq int(input()) int input() input print(c) print c def primeq(x):
    if x==1:return False
    for i in range(2,int(x**.5)+1):
        if x%i==0:return False
    return True def primeq(x):
    if x==1:return False
    for i in range(2,int(x**.5)+1):
        if x%i==0:return False
    return True primeq c=0 0 c
def primeq(x):
    if x==1:return False
    for i in range(2,int(x**.5)+1):
        if x%i==0:return False
    return True

c=0
for i in range(int(input())):
    if primeq(int(input())):c+=1
print(c)
