import java.math.BigInteger;
import java.util.Scanner;

public class Main {

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

        int n = sc.nextInt();

        int count = 0;
        for(int i = 0;i < n;i++){

        	// 	isProbablePrime()はこのBigIntegerが素数である可能性が高い場合はtrue、必ず合成数である場合はfalseを返します
            BigInteger bi = new BigInteger(sc.next());
            if(bi.isProbablePrime(5)) count++;

        }
        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