def is_prime(n):
    # ?´???°??????
    if n == 2:
        return True
    elif n < 2 or n & 1 == 0:
        return False
    for i in range(3, int(n**0.5) + 1, 2):
        if n % i == 0:
            return False
    return True

N = int(input())
cnt = 0
for i in range(N):
    e = int(input())
    if is_prime(e):
        cnt += 1
print(cnt) def is_prime(n):
    # ?´???°??????
    if n == 2:
        return True
    elif n < 2 or n & 1 == 0:
        return False
    for i in range(3, int(n**0.5) + 1, 2):
        if n % i == 0:
            return False
    return True is_prime if n == 2:
        return True
    elif n < 2 or n & 1 == 0:
        return False
     n == 2 n 2 return True True elif n < 2 or n & 1 == 0:
        return False
     n < 2 or n & 1 == 0 n < 2 n 2 n & 1 == 0 n & 1 n 1 0 return False False for i in range(3, int(n**0.5) + 1, 2):
        if n % i == 0:
            return False
     i range(3, int(n**0.5) + 1, 2) range 3 int(n**0.5) + 1 int(n**0.5) int n**0.5 n 0.5 1 2 if n % i == 0:
            return False
     n % i == 0 n % i n i 0 return False False return True True n n N = int(input()) N int(input()) int input() input cnt = 0 cnt 0 for i in range(N):
    e = int(input())
    if is_prime(e):
        cnt += 1 i range(N) range N e = int(input()) e int(input()) int input() input if is_prime(e):
        cnt += 1 is_prime(e) is_prime e cnt += 1 cnt 1 print(cnt) print cnt N = int(input()) int(input()) N cnt += 1 1 cnt def is_prime(n):
    # ?´???°??????
    if n == 2:
        return True
    elif n < 2 or n & 1 == 0:
        return False
    for i in range(3, int(n**0.5) + 1, 2):
        if n % i == 0:
            return False
    return True def is_prime(n):
    # ?´???°??????
    if n == 2:
        return True
    elif n < 2 or n & 1 == 0:
        return False
    for i in range(3, int(n**0.5) + 1, 2):
        if n % i == 0:
            return False
    return True is_prime e = int(input()) int(input()) e cnt = 0 0 cnt
def is_prime(n):
    # ?´???°??????
    if n == 2:
        return True
    elif n < 2 or n & 1 == 0:
        return False
    for i in range(3, int(n**0.5) + 1, 2):
        if n % i == 0:
            return False
    return True

N = int(input())
cnt = 0
for i in range(N):
    e = int(input())
    if is_prime(e):
        cnt += 1
print(cnt)