import java.util.Scanner;

public class Main {

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

		int n = sc.nextInt();
		int[] nums = inpNum(n);
		int num_prime = judgePrime(nums);
		System.out.println(num_prime);

		sc.close();
	}

	private static int judgePrime(int[] nums) {
		int num_prime = 0;
		boolean isPrime = true;

		for(int i = 0; i < nums.length; i++) {

			int sqrt = (int)Math.sqrt(nums[i]);
			isPrime = true;

				for (int j = 2; j <= sqrt ;j++) {
					if (nums[i] % j == 0) {
						isPrime = false;
						break;
					}
				}

			if (isPrime == true) {
				num_prime++;
			}

		}



		return num_prime;
	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

}

/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