import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            boolean[] FURUI = new boolean[100_000_000 + 1];
            for (int i = 2; i < FURUI.length; i++) {
                FURUI[i] = true;
            }
            for (int i = 2; i * i <= FURUI.length; i++) {
                if (FURUI[i] == false) {
                    continue;
                }
                for (int j = i + i; j < FURUI.length; j += i) {
                    FURUI[j] = false;
                }
            }
            int count = 0;
            while (N-- > 0) {
                count += FURUI[in.nextInt()] ? 1 : 0;
            }
            System.out.println(count);
        }
    }
}
/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