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

n = int(input())
nums = [int(input()) for _ in range(n)]
print(sum(map(is_prime, nums))) def is_prime(num):
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True is_prime for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
     i range(2, int(num ** 0.5) + 1) range 2 int(num ** 0.5) + 1 int(num ** 0.5) int num ** 0.5 num 0.5 1 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 int(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) int(input()) int input() input nums = [int(input()) for _ in range(n)] nums [int(input()) for _ in range(n)] print(sum(map(is_prime, nums))) print sum(map(is_prime, nums)) sum map(is_prime, nums) map is_prime nums nums = [int(input()) for _ in range(n)] [int(input()) for _ in range(n)] nums n = int(input()) int(input()) n def is_prime(num):
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True def is_prime(num):
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True is_prime
def is_prime(num):
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True

n = int(input())
nums = [int(input()) for _ in range(n)]
print(sum(map(is_prime, nums)))