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

def check_prime(n):
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 0
    else:
        return 1
    
for n in numbers:
    ans.append(check_prime(n))

print(sum(ans)) 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 numbers = [int(input()) for i in range(N)] numbers [int(input()) for i in range(N)] ans = [] ans [] def check_prime(n):
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 0
    else:
        return 1
     check_prime for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 0
    else:
        return 1
     i range(2, int(n**0.5)+1) range 2 int(n**0.5)+1 int(n**0.5) int n**0.5 n 0.5 1 if n % i == 0:
            return 0
     n % i == 0 n % i n i 0 return 0 0 return 1 1 n n for n in numbers:
    ans.append(check_prime(n)) n numbers ans.append(check_prime(n)) ans.append ans append check_prime(n) check_prime n print(sum(ans)) print sum(ans) sum ans numbers = [int(input()) for i in range(N)] [int(input()) for i in range(N)] numbers ans = [] [] ans def check_prime(n):
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 0
    else:
        return 1
     def check_prime(n):
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 0
    else:
        return 1
     check_prime N = int(input()) int(input()) N
N = int(input())
numbers = [int(input()) for i in range(N)]
ans = []

def check_prime(n):
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 0
    else:
        return 1
    
for n in numbers:
    ans.append(check_prime(n))

print(sum(ans))