import java.util.Scanner;

public class Main {

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

		int n = sc.nextInt();

//		long[] li = new long[n];
//		for (int i=0; i < n; i++) {
//			li[i] = sc.nextLong();
//		}

		int count = 0;
		for (int i=0; i < n; i++) {
			int x = sc.nextInt();
			if ( isPrime(x) ) count++;
		}

		System.out.println(count);

	}

	static boolean isPrime(int n) {
		if (n < 2) return false;
		else if (n == 2) return true;
		else {
			if (n % 2 == 0) return false;
			else {

				int i = 2;
				while (i*i <= n) {
					if (n % i == 0) return false;
					i++;
				}
				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