import java.util.Scanner;

public class Main {

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

		int n = scan.nextInt();
		int[] e = new int[n];
		for (int i = 0; i < n; i++)
			e[i] = scan.nextInt();

		int r = 0;
		for (int i = 0; i < n; i++)
			if (isPrime(e[i]))
				r++;
		System.out.println(r);

		scan.close();
		System.exit(0);
	}

	private static boolean isPrime(int x) {
		double max=Math.sqrt(x);
		for (int i = 2; i <= max; i++)
			if (x % i == 0)
				return false;
		return true;
	}
}
/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