import java.io.InputStream;
import java.util.Scanner;

public class Main {
	private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	}

	public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz