import java.util.Scanner;

public class Main {
	
	static Scanner scan;
	
	public static boolean judgePN(int a) {
		if (a == 1) return false;
		
		int quotient = a;
		
		for(int i = 2; i < a; i++) {
			quotient = a / i;
			if(a % i == 0) return false;
			if(i > quotient) break;
		}
		
		return true;
	}
	
	public static void main(String[] args) {
		scan = new Scanner(System.in);
		
		// Get the number of the input list
		final int n = scan.nextInt();
		
		// Get figures of the input list
		int list[] = new int[n];
		for(int i = 0; i < n; i++) {
			list[i] = scan.nextInt();
		}
		
		// Count the number of prime number
		int count = 0;
		for(int i = 0; i < n; i++) {
			if(judgePN(list[i])) count++;
		}
		
		// Output
		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