import java.util.*;

class Main {
	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		boolean[] prime = new boolean[100000000];
		Arrays.fill(prime,true);
		prime[0] = false;
		prime[1] = false;

		for (int i=2; i<100000000; i++) {
			if (prime[i]) {
				for (int j=i; j<100000000; j+=i) {
					prime[j] = false;
				}
				prime[i] = true;
			}
		}

		int count = 0;
		for (int i=0; i<n; i++) {
			if(prime[stdIn.nextInt()])
				count++;
		}
		System.out.println(count);
	}
}
/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