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

result = 0
n = int(input())
for n in range(n):
    result += isprime(int(input()))
print(result) def isprime(n):
    divider = 2
    while divider ** 2 <= n:
        if n % divider == 0:
            return False
        divider += 1
    return True isprime divider = 2 divider 2 while divider ** 2 <= n:
        if n % divider == 0:
            return False
        divider += 1
     divider ** 2 <= n divider ** 2 divider 2 n if n % divider == 0:
            return False
         n % divider == 0 n % divider n divider 0 return False False divider += 1 divider 1 return True True n n result = 0 result 0 n = int(input()) n int(input()) int input() input for n in range(n):
    result += isprime(int(input())) n range(n) range n result += isprime(int(input())) result isprime(int(input())) isprime int(input()) int input() input print(result) print result n = int(input()) int(input()) n def isprime(n):
    divider = 2
    while divider ** 2 <= n:
        if n % divider == 0:
            return False
        divider += 1
    return True def isprime(n):
    divider = 2
    while divider ** 2 <= n:
        if n % divider == 0:
            return False
        divider += 1
    return True isprime result = 0 0 result result += isprime(int(input())) isprime(int(input())) result
def isprime(n):
    divider = 2
    while divider ** 2 <= n:
        if n % divider == 0:
            return False
        divider += 1
    return True

result = 0
n = int(input())
for n in range(n):
    result += isprime(int(input()))
print(result)