N = int(input())
n = [int(input()) for i in range(N)]

def Is_prime(n):
    if n == 2:
        return True
    if n == 1:
        return False
    if n % 2 == 0:
        return False
    i = 3
    while i < int(n ** (0.5))+ 1:
        if n % i == 0:
            return False
        i += 2
    return True

count = 0
for j in n:
    if Is_prime(j):
        count += 1

print (count) N = int(input()) N int(input()) int input() input int(input()) for i in range(N) for i in range(N) i range(N) range N for i in range(N) int(input()) int input() input n = [int(input()) for i in range(N)] n [int(input()) for i in range(N)] def Is_prime(n):
    if n == 2:
        return True
    if n == 1:
        return False
    if n % 2 == 0:
        return False
    i = 3
    while i < int(n ** (0.5))+ 1:
        if n % i == 0:
            return False
        i += 2
    return True Is_prime if n == 2:
        return True
     n == 2 n 2 return True True if n == 1:
        return False
     n == 1 n 1 return False False if n % 2 == 0:
        return False
     n % 2 == 0 n % 2 n 2 0 return False False i = 3 i 3 while i < int(n ** (0.5))+ 1:
        if n % i == 0:
            return False
        i += 2
     i < int(n ** (0.5))+ 1 i int(n ** (0.5))+ 1 int(n ** (0.5)) int n ** (0.5) n 0.5 1 if n % i == 0:
            return False
         n % i == 0 n % i n i 0 return False False i += 2 i 2 return True True n n count = 0 count 0 for j in n:
    if Is_prime(j):
        count += 1 j n if Is_prime(j):
        count += 1 Is_prime(j) Is_prime j count += 1 count 1 print (count) print count n = [int(input()) for i in range(N)] [int(input()) for i in range(N)] n count = 0 0 count count += 1 1 count def Is_prime(n):
    if n == 2:
        return True
    if n == 1:
        return False
    if n % 2 == 0:
        return False
    i = 3
    while i < int(n ** (0.5))+ 1:
        if n % i == 0:
            return False
        i += 2
    return True def Is_prime(n):
    if n == 2:
        return True
    if n == 1:
        return False
    if n % 2 == 0:
        return False
    i = 3
    while i < int(n ** (0.5))+ 1:
        if n % i == 0:
            return False
        i += 2
    return True Is_prime N = int(input()) int(input()) N
N = int(input())
n = [int(input()) for i in range(N)]

def Is_prime(n):
    if n == 2:
        return True
    if n == 1:
        return False
    if n % 2 == 0:
        return False
    i = 3
    while i < int(n ** (0.5))+ 1:
        if n % i == 0:
            return False
        i += 2
    return True

count = 0
for j in n:
    if Is_prime(j):
        count += 1

print (count)