import math

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

num_set = set()
try:
	while True:
		num_set.add(eval(input()))
except EOFError:
	count = 0
	for x in num_set:
		count = count + (1 if is_prime(x) else 0)
	print(count) import math math def is_prime(num):
	prime = True
	for i in range(2,int(math.sqrt(num))+1):
		if num%i == 0:
			prime = False
			break
	return prime is_prime prime = True prime True for i in range(2,int(math.sqrt(num))+1):
		if num%i == 0:
			prime = False
			break
	 i range(2,int(math.sqrt(num))+1) range 2 int(math.sqrt(num))+1 int(math.sqrt(num)) int math.sqrt(num) math.sqrt math sqrt num 1 if num%i == 0:
			prime = False
			break
	 num%i == 0 num%i num i 0 prime = False prime False break return prime prime num num num_set = set() num_set set() set try:
	while True:
		num_set.add(eval(input()))
except EOFError:
	count = 0
	for x in num_set:
		count = count + (1 if is_prime(x) else 0)
	print(count) except EOFError:
	count = 0
	for x in num_set:
		count = count + (1 if is_prime(x) else 0)
	print(count) count = 0 count 0 for x in num_set:
		count = count + (1 if is_prime(x) else 0)
	 x num_set count = count + (1 if is_prime(x) else 0) count count + (1 if is_prime(x) else 0) count 1 if is_prime(x) else 0 is_prime(x) is_prime x 1 0 print(count) print count while True:
		num_set.add(eval(input())) True num_set.add(eval(input())) num_set.add num_set add eval(input()) eval input() input count = 0 0 count count = count + (1 if is_prime(x) else 0) count + (1 if is_prime(x) else 0) count def is_prime(num):
	prime = True
	for i in range(2,int(math.sqrt(num))+1):
		if num%i == 0:
			prime = False
			break
	return prime def is_prime(num):
	prime = True
	for i in range(2,int(math.sqrt(num))+1):
		if num%i == 0:
			prime = False
			break
	return prime is_prime num_set = set() set() num_set
import math

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

num_set = set()
try:
	while True:
		num_set.add(eval(input()))
except EOFError:
	count = 0
	for x in num_set:
		count = count + (1 if is_prime(x) else 0)
	print(count)