import math
n = input()
A = 0

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

for i in range(n):
	k = input()
	if is_prime(k):
		A += 1

print A import math math n = input() n input() input A = 0 A 0 def is_prime(m):
	for i in range(2, int(math.sqrt(m)) + 1):
		if (m % i == 0):
			return False
	return True is_prime for i in range(2, int(math.sqrt(m)) + 1):
		if (m % i == 0):
			return False
	 i range(2, int(math.sqrt(m)) + 1) range 2 int(math.sqrt(m)) + 1 int(math.sqrt(m)) int math.sqrt(m) math.sqrt math sqrt m 1 if (m % i == 0):
			return False
	 m % i == 0 m % i m i 0 return False False return True True m m for i in range(n):
	k = input()
	if is_prime(k):
		A += 1 i range(n) range n k = input() k input() input if is_prime(k):
		A += 1 is_prime(k) is_prime k A += 1 A 1 print k = input() input() k n = input() input() n A = 0 0 A def is_prime(m):
	for i in range(2, int(math.sqrt(m)) + 1):
		if (m % i == 0):
			return False
	return True def is_prime(m):
	for i in range(2, int(math.sqrt(m)) + 1):
		if (m % i == 0):
			return False
	return True is_prime A += 1 1 A
import math
n = input()
A = 0

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

for i in range(n):
	k = input()
	if is_prime(k):
		A += 1

print A