import math

def isPrime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if n % i == 0:
            return False
    return True

N = int(input())
nums = [int(input()) for i in range(N)]
print(sum([isPrime(n) for n in nums])) import math math def isPrime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if n % i == 0:
            return False
    return True isPrime for i in range(2, int(math.sqrt(n))+1):
        if n % i == 0:
            return False
     i range(2, int(math.sqrt(n))+1) range 2 int(math.sqrt(n))+1 int(math.sqrt(n)) int math.sqrt(n) math.sqrt math 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 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 nums = [int(input()) for i in range(N)] nums [int(input()) for i in range(N)] isPrime(n) for n in nums for n in nums n nums for n in nums isPrime(n) isPrime n print(sum([isPrime(n) for n in nums])) print sum([isPrime(n) for n in nums]) sum [isPrime(n) for n in nums] N = int(input()) int(input()) N def isPrime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if n % i == 0:
            return False
    return True def isPrime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if n % i == 0:
            return False
    return True isPrime nums = [int(input()) for i in range(N)] [int(input()) for i in range(N)] nums
import math

def isPrime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if n % i == 0:
            return False
    return True

N = int(input())
nums = [int(input()) for i in range(N)]
print(sum([isPrime(n) for n in nums]))