#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(1e18+1)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}


int main(void){
  int n;cin>>n;
  string s;cin>>s;
  ll ans = 0,one = 0, nine = 0;
  rep(i,n){
    if(s[i] == '3' || s[i] == '5' || s[i] == '7'){
      ans++;
    }else{
      if(s[i] == '1'){
        one++;
      }else{
        nine++;
      }
    }
  }
  int count = 0;
  int l=0,r=1;
  while(l<n){
    while(l<n && s[l] != '1') l++;
    if(l==n) break;
    chmax(r,l+1);
    while(r<n && s[r] != '9') r++;
    if(r==n) break;
    ans++;
    s[l] = '0';
    count++;
    one--;
    l++;
    r++;
  }
  r = n-1;
  while(count > 0){
    if(s[r] == '9'){
      s[r] = '0';
      count--;
    }
    r--;
  }
  int l0=0,l1=1;r=2;
  while(l1<n){
    while(l0<n && s[l0]!='9') l0++;
    if(l0==n) break;
    l1 = l0+1;
    while(l1<n && s[l1]!='9') l1++;
    if(l1==n) break;
    chmax(r, l1+1);
    while(r<n && s[r] != '1') r++;
    if(r==n) break;
    ans++;
    s[l0] = '0';
    s[l1] = '0';
    s[r] = '0';
    one--;
    l0 = l1+1;
  }
  ans += one/2;
  cout<<ans<<endl;
  return 0;
}