import java.util.Scanner;

class Main {

    private static boolean isPrime(int n){
        int sqrt = (int) Math.sqrt(n) + 1;
        
        for (int i = 2; i < sqrt; i++)
            if (n % i == 0)
                return false;

        return true;
    }


    public static void main(String[] args) throws Exception{

        Scanner sc = new Scanner(System.in);
        int length = sc.nextInt();

        int ans = 0;

        while (sc.hasNextInt())
            if (isPrime(sc.nextInt()))
                ans++;

        System.out.println(ans);
    }
}


/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