import java.util.Scanner;

public class Main {

	static boolean[] prime;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		prime = new boolean[100000001];
		int count = 0;

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

		int n = sc.nextInt();
		for (int i=0; i<n; i++) {
			int num = sc.nextInt();
			if (!prime[num]) {
				count++;
			}
		}

		System.out.println(count);

		sc.close();
	}

}
/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