//#include #include using namespace std; typedef long long ll; typedef pair p; const int INF = 1e9; const ll LINF = ll(1e18) + 1; const int MOD = 1000000007; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } //cout<> n>>s; ll ans=0; ll onecount=0; ll ninecount=0; string t=""; rep(i,n) { if(s[i]=='3'||s[i]=='7'||s[i]=='5'){ ans++; } else{ t+=s[i]; } } queue nine; vector used(t.size(),false); for(int i=t.size()-1;i>=0;i--){ if(t[i]=='9')nine.push(i); else if(!nine.empty()&&t[i]=='1'){ used[nine.front()]=true; nine.pop(); used[i]=true; ans++; } } string v=""; rep(i,t.size()){ if(!used[i])v+=t[i]; } rep(i,v.size()){ if(v[i]=='9')ninecount++; else{ if(ninecount>=2){ ninecount-=2; ans++; } else onecount++; } } /* cout<