#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    int n; cin >> n;
    string binary; cin >> binary;
    int ending =n-1;
    int start = 0;
    while(binary[ending] == '1' && ending >= 0) ending--;
    while(!binary[start] == '0' && start < n) start++;
    int ans1 = 0;
    int ans2 = 0;
    for(int i = 0; i <= ending; i++){
        if(binary[i] == '1') ans1++;
    }
    for(int i = start; i < n; i++){
        if(binary[i] == '0') ans2++;
    }
    cout << min(ans1,ans2) << endl;
    ans1 = 0;
    ans2 = 0;
    for(int i = 0; i <= ending; i++){
        if(binary[i] == '1'){
            int zero=0, one=1;
            if(binary[i+1] == '0' && i+1 < n) zero++;
            else one++;
            if(binary[i+2] == '0' &&  i+2 < n) zero++;
            else one++;
            if(binary[i+3] == '0'  &&  i+3 < n) zero++;
            else one++;
            if(zero == 2 && one == 2)
            {
                ans1++;
                i+=3;
            }
            else ans1++;
        }
    }
    for(int i = start; i < n; i++){
        if(binary[i] == '0')
        {
            int zero=0, one=1;
            if(binary[i+1] == '0'  &&  i+1 < n) zero++;
            else one++;
            if(binary[i+2] == '0'  &&  i+2 < n) zero++;
            else one++;
            if(binary[i+3] == '0'  &&  i+3 < n) zero++;
            else one++;
            if(zero == 2 && one == 2)
            {
                ans2++;
                i+=3;
            }
            else ans2++;
        }
    }
    cout << min(ans1, ans2);
	return 0;
}