n = int(input())
prime = 0

def is_prime(q):
    if q == 2:
        return True
    if q < 2:
        return False
    return pow(2, q-1, q) == 1


prime = 0
for i in range(n):
    m = int(input())
    if is_prime(m):
        prime += 1
print(prime) n = int(input()) n int(input()) int input() input prime = 0 prime 0 def is_prime(q):
    if q == 2:
        return True
    if q < 2:
        return False
    return pow(2, q-1, q) == 1 is_prime if q == 2:
        return True
     q == 2 q 2 return True True if q < 2:
        return False
     q < 2 q 2 return False False return pow(2, q-1, q) == 1 pow(2, q-1, q) == 1 pow(2, q-1, q) pow 2 q-1 q 1 q 1 q q prime = 0 prime 0 for i in range(n):
    m = int(input())
    if is_prime(m):
        prime += 1 i range(n) range n m = int(input()) m int(input()) int input() input if is_prime(m):
        prime += 1 is_prime(m) is_prime m prime += 1 prime 1 print(prime) print prime prime += 1 1 prime prime = 0 0 prime n = int(input()) int(input()) n def is_prime(q):
    if q == 2:
        return True
    if q < 2:
        return False
    return pow(2, q-1, q) == 1 def is_prime(q):
    if q == 2:
        return True
    if q < 2:
        return False
    return pow(2, q-1, q) == 1 is_prime m = int(input()) int(input()) m prime = 0 0 prime
n = int(input())
prime = 0

def is_prime(q):
    if q == 2:
        return True
    if q < 2:
        return False
    return pow(2, q-1, q) == 1


prime = 0
for i in range(n):
    m = int(input())
    if is_prime(m):
        prime += 1
print(prime)