def is_prime(num):
    if   num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
        return True

n = int(input())
ans = 0

for _ in range(n):
    num = int(input())
    if is_prime(num):
        ans += 1
print(ans) def is_prime(num):
    if   num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
        return True is_prime if   num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
        return True num == 2 num 2 return True True elif num % 2 == 0:
        return False
     num % 2 == 0 num % 2 num 2 0 return False False for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
         i range(3,int(num**0.5)+1,2) range 3 int(num**0.5)+1 int(num**0.5) int num**0.5 num 0.5 1 2 if num % i == 0:
                return False
         num % i == 0 num % i num i 0 return False False return True True num num n = int(input()) n int(input()) int input() input ans = 0 ans 0 for _ in range(n):
    num = int(input())
    if is_prime(num):
        ans += 1 _ range(n) range n num = int(input()) num int(input()) int input() input if is_prime(num):
        ans += 1 is_prime(num) is_prime num ans += 1 ans 1 print(ans) print ans num = int(input()) int(input()) num ans = 0 0 ans ans += 1 1 ans n = int(input()) int(input()) n def is_prime(num):
    if   num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
        return True def is_prime(num):
    if   num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
        return True is_prime
def is_prime(num):
    if   num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        for i in range(3,int(num**0.5)+1,2):
            if num % i == 0:
                return False
        return True

n = int(input())
ans = 0

for _ in range(n):
    num = int(input())
    if is_prime(num):
        ans += 1
print(ans)
