import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		int k,i;
		int s = 0;
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		int array[] = new int[n];
		for(i=0;i<n;i++)array[i] = Integer.parseInt(in.next());
		for (k=0;k<n;k++){
			if (isprime(array[k])){
				s++;
		}
	}
		System.out.println(s);
}

	public static boolean isprime(int x) {
		int i = 3;
		if (x == 2)
				return true;
		if (x < 2 || x % 2 == 0 )
				return false;
		while (i <= Math.sqrt(x)){
			if (x % i == 0){
				return false;
			}
			i = i+2;
		}
		return true;
	}
}
/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