import java.util.*;
import java.math.*;
class Main {
	static boolean isPrime(int N)
	{
		for (int i = 2; i <= Math.sqrt(N); i++) 
		{
			if(N % i == 0){return false;}
	    }
		return N!=1;
    }
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i=0; i<n; i++) {
			if(isPrime(sc.nextInt()))
				cnt++;
		}
		System.out.println(cnt);
	}
    


}




/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