//#pragma GCC optimize("Ofast") //#pragma GCC target("avx") //#undef LOCAL #include using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template using V = vector; template using VV = V>; #ifdef LOCAL struct PrettyOS { ostream& os; bool first; template auto operator<<(T&& x) { if (!first) os << ", "; first = false; os << x; return *this; } }; template void dbg0(T&&... t) { (PrettyOS{cerr, true} << ... << t); } #define dbg(...) \ do { \ cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \ dbg0(__VA_ARGS__); \ cerr << endl; \ } while (false); #else #define dbg(...) #endif template ostream& operator<<(ostream& os, const pair& p) { return os << "P(" << p.first << ", " << p.second << ")"; } template ostream& operator<<(ostream& os, const V& v) { os << "["; for (auto d : v) os << d << ", "; return os << "]"; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); int n; string s; cin >> n >> s; int ans = 0; V oc(n + 1), nc(n + 1); for (int i = 0; i < n; i++) { oc[i + 1] = oc[i]; nc[i + 1] = nc[i]; if (s[i] == '3' || s[i] == '7' || s[i] == '5') { ans++; continue; } if (s[i] == '1') { oc[i + 1]++; } else { nc[i + 1]++; } } int O = oc.back(); int N = nc.back(); int ma = 0; for (int i = 0; i <= n; i++) { int buf = 0; buf += min(oc[i], N - nc[i]); // 19 buf += min(nc[i] / 2, O - oc[i]); // 991 buf += (O - buf) / 2; // 11 ma = max(ma, buf); } ans += ma; cout << ans << endl; return 0; }