import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
import java.lang.Math;

public class Main {
	public static void main(String[] args){
		int i, size, count = 0;
		List<Integer> numbers = new ArrayList<Integer>();

		Scanner in = new Scanner(System.in);
		
		size = Integer.parseInt(in.nextLine());
		for(i = 0; i < size; i++) numbers.add(Integer.parseInt(in.nextLine()));

		for(i = 0; i < size; i++){
			if(isPrime(numbers.get(i)) == true) count++;
		}
		System.out.println(count);
		}
	
	private static boolean isPrime(int number){
		int i;
		int route = (int)Math.sqrt(number) + 1;

		if(number == 1) return false;

		for(i = 2; i < route; i++){
			if(number % i == 0) return false;
		}
		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