/*************

   HDU 2138

   by chty

   2016.11.5

 *************/

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<ctime>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 typedef long long ll;

 ll n,ans;

 inline ll read()

 {

     ll x=,f=;  char ch=getchar();

     while(!isdigit(ch))  {if(ch=='-')  f=-;  ch=getchar();}

     while(isdigit(ch))  {x=x*+ch-'';  ch=getchar();}

     return x*f;

 }

 ll fast(ll a,ll b,ll mod) {ll sum=;for(;b;b>>=,a=a*a%mod)if(b&)sum=sum*a%mod;return sum;}//一行快速幂

 bool Rabin_Miller(ll p,ll a)

 {

     if(p==)  return ;

     if(p&==||p==)  return ;

     ll d=p-;

     while(!(d&))  d>>=;

     ll m=fast(a,d,p);

     if(m==)  return ;

     while(d<p)

     {

         if(m==p-)  return ;

         d<<=;

         m=m*m%p;

     }

     return ;

 }

 bool isprime(ll x)

 {

     static ll prime[]={,,,,,,,,};

     for(ll i=;i<;i++)

     {

         if(x==prime[i])  return ;

         if(!Rabin_Miller(x,prime[i]))  return ;

     }

     return ;

 }

 int main()

 {

     freopen("cin.in","r",stdin);

     freopen("cout.out","w",stdout);

     while(~scanf("%lld",&n))

     {

         ans=;

         for(ll i=;i<=n;i++)

         {

             ll x=read();

             if(isprime(x))  ans++;

         }

         printf("%lld\n",ans);

     }

     return ;

 }