import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		//prime numbers
		Scanner in = new Scanner(System.in);
	      int prime =0;
	      int n = in.nextInt();
	      int[] array = new int[n];
	      for(int i =0;i<n;i++){
	         array[i]= in.nextInt();
	      }
	      for(int j = 0; j<n;j++){
	    	  Boolean primeN = true;
	         for(int x = 2;x<Math.sqrt(array[j]+1);x++) {
	        	 if(array[j]%x==0) {
	        		 primeN = false;
	        	 }
	         }
	         if(primeN==true) {
	        	 prime+=1;
	         }
	         
	      }
	      System.out.println(prime);
}}

/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