def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True
n = int(input())
print(sum(is_prime(int(input())) for _ in range(n))) def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True is_prime if x == 2:
        return True
     x == 2 x 2 return True True if x < 2 or x % 2 == 0:
        return False
     x < 2 or x % 2 == 0 x < 2 x 2 x % 2 == 0 x % 2 x 2 0 return False False for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
     i range(3, int(x ** .5) + 1, 2) range 3 int(x ** .5) + 1 int(x ** .5) int x ** .5 x .5 1 2 if x % i == 0:
            return False
     x % i == 0 x % i x i 0 return False False return True True x x n = int(input()) n int(input()) int input() input print(sum(is_prime(int(input())) for _ in range(n))) print sum(is_prime(int(input())) for _ in range(n)) sum is_prime(int(input())) is_prime int(input()) int input() input def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True is_prime n = int(input()) int(input()) n
def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True
n = int(input())
print(sum(is_prime(int(input())) for _ in range(n)))
