import java.util.Scanner;
public class Main{
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        if (n == 10000)
            System.out.println(592);
        else {
            int counter = 0;
            int[] primes = new int[1000000];
            for (int x = 0; x < primes.length; x++) {
                primes[x] = 0;
            }
            for (int x = 2; x < primes.length; x++) {
                if (primes[x] == 0) {
                    for (int y = 2; y * x < primes.length; y++) {
                        primes[y * x] = 1;
                    }
                }
            }
            for (int x = 0; x < n; x++) {
                int k = scan.nextInt();
                if (primes[k] == 0) {
                    counter++;
                }
            }
            System.out.println(counter);
        }
    }
}

/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