#include <iostream>#include <cmath>using namespace std;
int estePrim(int n) { int prim =1, i =2; if (n==1) return 1; while (prim && i<=sqrt(n)) { if (n%i==0) prim =0; i++; } return prim;}
int main(){ int n, nr, contor=0; cin>>n; for(int i=1; i<=n; i++) { cin>>nr; if (estePrim(nr)) contor++; }
cout<<contor; return 0;}