#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

// 6
// 0 1 1 0 0 1


vector<int> a;

int consistency1(int n){
	
	vector<int> condensed;
	
	for(int i=0; i<n; ){
		int j = i;
		while(j<n && a[j] == a[i]) j++;
		int ct = j-i;
		condensed.push_back(ct);
		i = j;
	}
	
	int m = condensed.size();
	if(m==1) return 0;
	
	int ans = 0;
	for(int i=1; i<m; i++){
		ans += min(condensed[i], condensed[i-1]);
	}
	
	return ans;
}




int consistency2(int n){
	
	vector<int> zero(n+1);
	vector<int> one(n+1);
	
	int ans = 0;
	for(int i=0; i<n; i++){
		if(a[i] == 0){
			zero[i+1] = zero[i] + 1;
			int ct = zero[i+1];
			
			if(one[i+1-ct] >= ct) ans++;
		}
		else{
			one[i+1] += one[i] + 1;
			int ct = one[i+1];
			
			if(zero[i+1-ct] >= ct) ans++;
		}
	}
	
	
	return ans;
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n) << " " <<  consistency2(n)  << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}