import math

def prime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if  n % i == 0:
            return False
    return True

num_prime = []
k = 0
while True:
    try:
        n = input()
    except:
        break
    if prime(int(n)):
        if not int(n) in num_prime:
            k += 1
            num_prime.append(int(n))

print(k) import math math def prime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if  n % i == 0:
            return False
    return True prime for i in range(2, int(math.sqrt(n))+1):
        if  n % i == 0:
            return False
     i range(2, int(math.sqrt(n))+1) range 2 int(math.sqrt(n))+1 int(math.sqrt(n)) int math.sqrt(n) math.sqrt math sqrt n 1 if  n % i == 0:
            return False
     n % i == 0 n % i n i 0 return False False return True True n n num_prime = [] num_prime [] k = 0 k 0 while True:
    try:
        n = input()
    except:
        break
    if prime(int(n)):
        if not int(n) in num_prime:
            k += 1
            num_prime.append(int(n)) True try:
        n = input()
    except:
        break
     except:
        break
     break n = input() n input() input if prime(int(n)):
        if not int(n) in num_prime:
            k += 1
            num_prime.append(int(n)) prime(int(n)) prime int(n) int n if not int(n) in num_prime:
            k += 1
            num_prime.append(int(n)) not int(n) in num_prime int(n) in num_prime int(n) int n num_prime k += 1 k 1 num_prime.append(int(n)) num_prime.append num_prime append int(n) int n print(k) print k k += 1 1 k k = 0 0 k num_prime = [] [] num_prime n = input() input() n def prime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if  n % i == 0:
            return False
    return True def prime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if  n % i == 0:
            return False
    return True prime
import math

def prime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if  n % i == 0:
            return False
    return True

num_prime = []
k = 0
while True:
    try:
        n = input()
    except:
        break
    if prime(int(n)):
        if not int(n) in num_prime:
            k += 1
            num_prime.append(int(n))

print(k)