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

count = 0

number = int(input())
for i in range(number):
    n = int(input())
    if is_prime(n):
        count = count + 1

print(count) def is_prime(n):
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True is_prime i = 2 i 2 while i * i <= n:
        if n % i == 0:
            return False
        i += 1
     i * i <= n i * i i i n if n % i == 0:
            return False
         n % i == 0 n % i n i 0 return False False i += 1 i 1 return True True n n count = 0 count 0 number = int(input()) number int(input()) int input() input for i in range(number):
    n = int(input())
    if is_prime(n):
        count = count + 1 i range(number) range number n = int(input()) n int(input()) int input() input if is_prime(n):
        count = count + 1 is_prime(n) is_prime n count = count + 1 count count + 1 count 1 print(count) print count n = int(input()) int(input()) n def is_prime(n):
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True def is_prime(n):
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True is_prime count = count + 1 count + 1 count count = 0 0 count number = int(input()) int(input()) number
def is_prime(n):
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True

count = 0

number = int(input())
for i in range(number):
    n = int(input())
    if is_prime(n):
        count = count + 1

print(count)