import java.util.Scanner;

class Main {
    public static Boolean PrimeCheck(int x){
	for(int i=2; i<=Math.sqrt(x);i++){
	    if(x%i==0){
		return false;
	    }
	}
	return true;
    }
     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++){
	     int x = sc.nextInt();
	     if(PrimeCheck(x)){
		 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