import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = Integer.valueOf(scan.next());
        int cnt = 0;
        for(int i=0;i<n;i++) {
        	cnt+=isPrime(Integer.valueOf(scan.next()));
        }
        System.out.println(cnt);
        scan.close();
    }
    public static int isPrime(int n) {
        if (n<2) {
        	return 0;
        }
        else if (n==2) {
        	return 1;
        }
        else if (n%2==0) {
        	return 0;
        }
        for (int i = 3; i <= Math.sqrt(n); i+=2){
            if (n%i==0){
                return 0;
            }
        }
        return 1;
    }
}

/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