def isPrime(num):
	flag = True
	if(num==1):
		return False
	for i in range(2,int(num**0.5)+1):
		if(num%i==0):
			flag = False
			break
	return flag

a = []
temp = 0
n = int(input().strip())
for i in range(n):
	temp = int(input().strip())
	if isPrime(temp):
		a.append(temp)
print(len(a)) def isPrime(num):
	flag = True
	if(num==1):
		return False
	for i in range(2,int(num**0.5)+1):
		if(num%i==0):
			flag = False
			break
	return flag isPrime flag = True flag True if(num==1):
		return False
	 num==1 num 1 return False False for i in range(2,int(num**0.5)+1):
		if(num%i==0):
			flag = False
			break
	 i range(2,int(num**0.5)+1) range 2 int(num**0.5)+1 int(num**0.5) int num**0.5 num 0.5 1 if(num%i==0):
			flag = False
			break
	 num%i==0 num%i num i 0 flag = False flag False break return flag flag num num a = [] a [] temp = 0 temp 0 n = int(input().strip()) n int(input().strip()) int input().strip() ().strip () input strip for i in range(n):
	temp = int(input().strip())
	if isPrime(temp):
		a.append(temp) i range(n) range n temp = int(input().strip()) temp int(input().strip()) int input().strip() ().strip () input strip if isPrime(temp):
		a.append(temp) isPrime(temp) isPrime temp a.append(temp) a.append a append temp print(len(a)) print len(a) len a n = int(input().strip()) int(input().strip()) n a = [] [] a temp = 0 0 temp temp = int(input().strip()) int(input().strip()) temp def isPrime(num):
	flag = True
	if(num==1):
		return False
	for i in range(2,int(num**0.5)+1):
		if(num%i==0):
			flag = False
			break
	return flag def isPrime(num):
	flag = True
	if(num==1):
		return False
	for i in range(2,int(num**0.5)+1):
		if(num%i==0):
			flag = False
			break
	return flag isPrime
def isPrime(num):
	flag = True
	if(num==1):
		return False
	for i in range(2,int(num**0.5)+1):
		if(num%i==0):
			flag = False
			break
	return flag

a = []
temp = 0
n = int(input().strip())
for i in range(n):
	temp = int(input().strip())
	if isPrime(temp):
		a.append(temp)
print(len(a))