import math

def is_prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return n != 1

n = int(input())
answer = 0
for _ in range(0, n):
    m = int(input())
    if is_prime(m):
        answer = answer + 1
print(answer) import math math def is_prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return n != 1 is_prime for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
     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 False
     n % i == 0 n % i n i 0 return False False return n != 1 n != 1 n 1 n n n = int(input()) n int(input()) int input() input answer = 0 answer 0 for _ in range(0, n):
    m = int(input())
    if is_prime(m):
        answer = answer + 1 _ range(0, n) range 0 n m = int(input()) m int(input()) int input() input if is_prime(m):
        answer = answer + 1 is_prime(m) is_prime m answer = answer + 1 answer answer + 1 answer 1 print(answer) print answer m = int(input()) int(input()) m answer = answer + 1 answer + 1 answer n = int(input()) int(input()) n answer = 0 0 answer def is_prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return n != 1 def is_prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return n != 1 is_prime
import math

def is_prime(n):
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return n != 1

n = int(input())
answer = 0
for _ in range(0, n):
    m = int(input())
    if is_prime(m):
        answer = answer + 1
print(answer)
