#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    string B;
    cin >> N >> B;

    vector<int> pref1(N+1, 0);
    for (int i = 1; i <= N; i++)
        pref1[i] = pref1[i-1] + (B[i-1] == '1');

    int total1 = pref1[N];
    int total0 = N - total1;


    int best = N;
    for (int k = 0; k <= N; k++) {
        int ones_left = pref1[k];
        int zeros_right = (N - k) - (total1 - pref1[k]);
        best = min(best, ones_left + zeros_right);
    }

    cout << best << "\n";













    int minErrors = best;
    int bestK = 0;
    for (int k = 0; k <= N; k++) {
        int ones_left = pref1[k];
        int zeros_right = (N - k) - (total1 - pref1[k]);
        if (ones_left + zeros_right == best) {
            bestK = k;
            break;
        }
    }

    vector<int> err(N, 0);
    for (int i = 0; i < N; i++) {
        if (i < bestK && B[i] == '1') err[i] = 1;
        if (i >= bestK && B[i] == '0') err[i] = 1;
    }

    int used = 0;
    vector<int> taken(N, 0);

    for (int i = 0; i + 3 < N; i++) {
        int cnt = 0;
        for (int j = 0; j < 4; j++)
            if (err[i+j] && !taken[i+j]){
                cnt++;
            }

        if (cnt == 2) {
            for (int j = 0; j < 4; j++)
                if (err[i+j]) {
                    taken[i+j] = 1;
                }
            used++;
        }
    }

    int answer2 = minErrors - used;
    cout << answer2;

    return 0;
}