n = int(raw_input())
a = []
for i in range(n):
    a.append(int(raw_input()))

nprimes = 0
a = sorted(a)
while True:
    for d in range(2,10001):
        if d**2>a[0]:
            nprimes+=1
            del a[0]
            break
        elif a[0]%d==0:
            del a[0]
            break
    if len(a) <= 0:
        break

print nprimes n = int(raw_input()) n int(raw_input()) int raw_input() raw_input a = [] a [] for i in range(n):
    a.append(int(raw_input())) i range(n) range n a.append(int(raw_input())) a.append a append int(raw_input()) int raw_input() raw_input nprimes = 0 nprimes 0 a = sorted(a) a sorted(a) sorted a while True:
    for d in range(2,10001):
        if d**2>a[0]:
            nprimes+=1
            del a[0]
            break
        elif a[0]%d==0:
            del a[0]
            break
    if len(a) <= 0:
        break True for d in range(2,10001):
        if d**2>a[0]:
            nprimes+=1
            del a[0]
            break
        elif a[0]%d==0:
            del a[0]
            break
     d range(2,10001) range 2 10001 if d**2>a[0]:
            nprimes+=1
            del a[0]
            break
        elif a[0]%d==0:
            del a[0]
            break
     d**2>a[0] d**2 d 2 a[0] a 0 nprimes+=1 nprimes 1 del a[0] a[0] a 0 break elif a[0]%d==0:
            del a[0]
            break
     a[0]%d==0 a[0]%d a[0] a 0 d 0 del a[0] a[0] a 0 break if len(a) <= 0:
        break len(a) <= 0 len(a) len a 0 break print nprimes = 0 0 nprimes nprimes+=1 1 nprimes a = [] [] a a = sorted(a) sorted(a) a n = int(raw_input()) int(raw_input()) n
n = int(raw_input())
a = []
for i in range(n):
    a.append(int(raw_input()))

nprimes = 0
a = sorted(a)
while True:
    for d in range(2,10001):
        if d**2>a[0]:
            nprimes+=1
            del a[0]
            break
        elif a[0]%d==0:
            del a[0]
            break
    if len(a) <= 0:
        break

print nprimes