def isprime(n):
    from math import floor,sqrt
    if n <= 1:
        return False
    for i in range(2,floor(sqrt(n))+1):
        if n % i == 0:
            return False
    return True

n = int(input())
ans = []
for i in range(n):
    po = int(input())
    if isprime(po):
        ans.append(po)  
print(len(ans)) def isprime(n):
    from math import floor,sqrt
    if n <= 1:
        return False
    for i in range(2,floor(sqrt(n))+1):
        if n % i == 0:
            return False
    return True isprime from math import floor,sqrt if n <= 1:
        return False
     n <= 1 n 1 return False False for i in range(2,floor(sqrt(n))+1):
        if n % i == 0:
            return False
     i range(2,floor(sqrt(n))+1) range 2 floor(sqrt(n))+1 floor(sqrt(n)) floor sqrt(n) sqrt n 1 if n % i == 0:
            return False
     n % i == 0 n % i n i 0 return False False return True True n n n = int(input()) n int(input()) int input() input ans = [] ans [] for i in range(n):
    po = int(input())
    if isprime(po):
        ans.append(po)   i range(n) range n po = int(input()) po int(input()) int input() input if isprime(po):
        ans.append(po)   isprime(po) isprime po ans.append(po) ans.append ans append po print(len(ans)) print len(ans) len ans ans = [] [] ans def isprime(n):
    from math import floor,sqrt
    if n <= 1:
        return False
    for i in range(2,floor(sqrt(n))+1):
        if n % i == 0:
            return False
    return True def isprime(n):
    from math import floor,sqrt
    if n <= 1:
        return False
    for i in range(2,floor(sqrt(n))+1):
        if n % i == 0:
            return False
    return True isprime po = int(input()) int(input()) po n = int(input()) int(input()) n
def isprime(n):
    from math import floor,sqrt
    if n <= 1:
        return False
    for i in range(2,floor(sqrt(n))+1):
        if n % i == 0:
            return False
    return True

n = int(input())
ans = []
for i in range(n):
    po = int(input())
    if isprime(po):
        ans.append(po)  
print(len(ans))
