//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>

using namespace std;

#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}

using LL = long long;

//------------------------------------------
//------------------------------------------

int main() {

    int N;
    cin >> N;

    string S;
    cin >> S;

    string T = "";

    int ans = 0;
    for (auto c: S) {
        if (c == '1' or c == '9') T += c;
        else ans++;
    }

    vector<string> cand = {"11", "19", "991"};
    vector<int> dp(T.size() + 1, 0);

    for (int i = 0; i <= T.size(); i++) {
        for (int j = 0; j < 3; j++) {
            string s = cand[j];
            int pos = i - s.size() ;
            if (pos >= 0 && T.substr(pos, s.size()) == s) {
                dp[i] = max(dp[i], dp[pos] + 1);
            }
        }
    }

    cout << *max_element(dp.begin(), dp.end()) + ans << endl;

    return 0;
}