def is_prime(num):
    i = 2
    while i * i <= num:
        if num % i == 0:
            return False
        i += 1
    return True


N = int(input())
num_list = [int(input()) for _ in range(N)]
print(sum(is_prime(num) for num in num_list)) def is_prime(num):
    i = 2
    while i * i <= num:
        if num % i == 0:
            return False
        i += 1
    return True is_prime i = 2 i 2 while i * i <= num:
        if num % i == 0:
            return False
        i += 1
     i * i <= num i * i i i num if num % i == 0:
            return False
         num % i == 0 num % i num i 0 return False False i += 1 i 1 return True True num num N = int(input()) N int(input()) int input() input int(input()) for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) int(input()) int input() input num_list = [int(input()) for _ in range(N)] num_list [int(input()) for _ in range(N)] print(sum(is_prime(num) for num in num_list)) print sum(is_prime(num) for num in num_list) sum is_prime(num) is_prime num num_list = [int(input()) for _ in range(N)] [int(input()) for _ in range(N)] num_list def is_prime(num):
    i = 2
    while i * i <= num:
        if num % i == 0:
            return False
        i += 1
    return True def is_prime(num):
    i = 2
    while i * i <= num:
        if num % i == 0:
            return False
        i += 1
    return True is_prime N = int(input()) int(input()) N
def is_prime(num):
    i = 2
    while i * i <= num:
        if num % i == 0:
            return False
        i += 1
    return True


N = int(input())
num_list = [int(input()) for _ in range(N)]
print(sum(is_prime(num) for num in num_list))
