#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

int main(){
  int n;
  string s;
  while(cin >> n >> s){
    int ans = 0;

    string t;

    REP(i,n){
      if(s[i] == '3' or s[i] == '5' or s[i] == '7'){
        ans += 1;
      }else{
        t += s[i];
      }
    }

    dump(t);

    vector<int> check(t.size());
    stack<int> one;
    
    REP(i,t.size()){
      if(t[i] == '1'){
        one.push(i);
      }else{
        if(one.size()){
          int j = one.top(); one.pop();
          check[j] = true;
          check[i] = true;
          
          ans += 1;
        }
      }
    }

    string t2;
    
    int c = 0;
    REP(i,t.size()){
      if(not check[i]){
        if(t[i] == '1') ++c;
        t2 += t[i];
      }
    }


    ans += c/2;

    dump(t2);

    int nine = count(ALL(t2), '9');

    if(nine >= 2 and t2.size() and t2.back() == '1'){
      ++ans;
    }
    
    

    
    
    



    cout << ans << endl;
  }



  return 0;
}