def prime(x):
    if  x == 2:
        return True
    elif x < 2 or  x %2 == 0:
        return False
    i = 3
    while i <= x**(1/2):
        if x % i == 0:
            return False
        i = i + 2

    return True

L = []
while True:
    try:
        i = int(input())
        L.append(i)
    except EOFError:
        break
K = 0
for i in range(len(L)):
    if prime(L[i]):
        K += 1

print(K) def prime(x):
    if  x == 2:
        return True
    elif x < 2 or  x %2 == 0:
        return False
    i = 3
    while i <= x**(1/2):
        if x % i == 0:
            return False
        i = i + 2

    return True prime if  x == 2:
        return True
    elif x < 2 or  x %2 == 0:
        return False
     x == 2 x 2 return True True elif x < 2 or  x %2 == 0:
        return False
     x < 2 or  x %2 == 0 x < 2 x 2 x %2 == 0 x %2 x 2 0 return False False i = 3 i 3 while i <= x**(1/2):
        if x % i == 0:
            return False
        i = i + 2

     i <= x**(1/2) i x**(1/2) x 1/2 1 2 if x % i == 0:
            return False
         x % i == 0 x % i x i 0 return False False i = i + 2 i i + 2 i 2 return True True x x L = [] L [] while True:
    try:
        i = int(input())
        L.append(i)
    except EOFError:
        break True try:
        i = int(input())
        L.append(i)
    except EOFError:
        break except EOFError:
        break break i = int(input()) i int(input()) int input() input L.append(i) L.append L append i K = 0 K 0 for i in range(len(L)):
    if prime(L[i]):
        K += 1 i range(len(L)) range len(L) len L if prime(L[i]):
        K += 1 prime(L[i]) prime L[i] L i K += 1 K 1 print(K) print K i = int(input()) int(input()) i def prime(x):
    if  x == 2:
        return True
    elif x < 2 or  x %2 == 0:
        return False
    i = 3
    while i <= x**(1/2):
        if x % i == 0:
            return False
        i = i + 2

    return True def prime(x):
    if  x == 2:
        return True
    elif x < 2 or  x %2 == 0:
        return False
    i = 3
    while i <= x**(1/2):
        if x % i == 0:
            return False
        i = i + 2

    return True prime L = [] [] L K += 1 1 K K = 0 0 K
def prime(x):
    if  x == 2:
        return True
    elif x < 2 or  x %2 == 0:
        return False
    i = 3
    while i <= x**(1/2):
        if x % i == 0:
            return False
        i = i + 2

    return True

L = []
while True:
    try:
        i = int(input())
        L.append(i)
    except EOFError:
        break
K = 0
for i in range(len(L)):
    if prime(L[i]):
        K += 1

print(K)
