def isPrime(n):
    if n==2 or n==3:
        return True
    elif n%2==0:
        return False
    else:
        i = 2
        while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
    return True
    
r = []
n = int(input())
for i in range(n):
    p = int(input())
    if isPrime(p):
        if p not in r:
            r.append(p)

print(len(r)) def isPrime(n):
    if n==2 or n==3:
        return True
    elif n%2==0:
        return False
    else:
        i = 2
        while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
    return True
     isPrime if n==2 or n==3:
        return True
    elif n%2==0:
        return False
    else:
        i = 2
        while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
     n==2 or n==3 n==2 n 2 n==3 n 3 return True True elif n%2==0:
        return False
     n%2==0 n%2 n 2 0 return False False i = 2 i 2 while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
     i**2 <= n i**2 i 2 n if n%i == 0:
                return False
             n%i == 0 n%i n i 0 return False False i += 1 i 1 return True True n n r = [] r [] n = int(input()) n int(input()) int input() input for i in range(n):
    p = int(input())
    if isPrime(p):
        if p not in r:
            r.append(p) i range(n) range n p = int(input()) p int(input()) int input() input if isPrime(p):
        if p not in r:
            r.append(p) isPrime(p) isPrime p if p not in r:
            r.append(p) p not in r p r r.append(p) r.append r append p print(len(r)) print len(r) len r def isPrime(n):
    if n==2 or n==3:
        return True
    elif n%2==0:
        return False
    else:
        i = 2
        while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
    return True
     def isPrime(n):
    if n==2 or n==3:
        return True
    elif n%2==0:
        return False
    else:
        i = 2
        while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
    return True
     isPrime r = [] [] r p = int(input()) int(input()) p n = int(input()) int(input()) n
def isPrime(n):
    if n==2 or n==3:
        return True
    elif n%2==0:
        return False
    else:
        i = 2
        while i**2 <= n:
            if n%i == 0:
                return False
            i += 1
    return True
    
r = []
n = int(input())
for i in range(n):
    p = int(input())
    if isPrime(p):
        if p not in r:
            r.append(p)

print(len(r))