#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool nt(ll n)
{
    for(ll i=2;i<=sqrt(n);++i)
    {
        if(n%i==0)
            return false;
    }
    return true;
}
ll cl(ll n)
{
    ll c=0; ll l=0;
    while(n!=0)
    {
        ll k=n%10;
        if(k%2==0)
        {
            c++;
        }
        else
        {
            l++;
        }
        n/=10;
    }
    return c!=l;
}
int main()
{
ll n,dem=0;
cin>>n;
ll a[100000];
for(ll i=0;i<n;++i)
{
    cin>>a[i];
    if(nt(a[i])&&cl(a[i]))
    {
        dem++;
    }
}
cout<<dem;
}

#include<bits/stdc++.h>

using namespace std;

bool pm(int n){

if(n<=1) return false;

if(n<=3) return true;

if(n%2==0 || n%3==0) return false;

for(int i=5;i*i<=n;i+=6){

if(n%i==0 || n% (i+2)==0)

return false;

}

return true;

}

pair<int,int> dem(int n){

int e=0;o=0;

while(n>0){

int d=n%10;

if(d%2==0)

e++;

else

  o++;

n/=10;

}

return make_pair(e,o);

}

int kq(vector<int>&A){

int c=0;

for(int i=0;i<A.size();++i){

if(pm(A[i])){

pair<int,int> co=dem(A[i]);

if(co.first!=co.second)

c++;

}

}

return c;

}
int main(){

int N;

cin>>N;

vector<int>A(N);

for(int i=0;i<N;++i){

cin>>A[i];

}

cout<<kq(A)<<endl;

return 0;

}
#danglam228