#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
    
#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
    
ll n,cnt,ans,a,b,d,tmp,tmpp,m,h,w,x,y,sum,pos,k,q;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s,co,s1;
bool fl;
struct edge{int to,cost;};
    
//------ Believe yourself as a genius!!!!!! ------
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>n>>co;
    rep(i,Size(co)){
        if(co[i]=='3'||co[i]=='5'||co[i]=='7'){
            ans++;
        }
        else{
            s+=co[i];
            if(co[i]=='1'){
                cnt++;
            }
        }
    }
    tmp=-1;
    rrrep(i,Size(s)-1,0){
        if(s[i]=='9'){
            tmp=i+1;
            break;
        }
    }
    //11 19 991

    //19
    ll iti=0;
    rep(i,Size(s)){
        if(s[i]=='1')iti++;
        else{
            if(iti==0){
                s1+=s[i];
                continue;
            }
            ans++;
            iti--;
            cnt--;
        }
    }
    ll qu=0;
    if(tmp!=-1){
        rrep(i,tmp,Size(s))s1+="1";
    }
    //Cout(s1);
    //991
    rep(i,Size(s1)){
        if(s1[i]=='1'){
            if(qu<=1)continue;
            ans++;
            qu-=2;
            cnt--;
        }
        else{
            qu++;
        }
    }
    ans+=cnt/2;
    Cout(ans);
    return 0;
}