#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 *******************************



vector<int> a;

//* Template 1 : 

int consistency1(int n){
	
	int k = 0;
	for(int i=0; i<n; i++) if(a[i] == 1) k++;
	if(k == 0) return -1;
	
	int s = 0, e = 0; 
	int zeroes = 0;
	int ans = INF;
	
	while(e<n){
		if(a[e] == 0) zeroes++;
		
		if(e-s+1 < k){
			e++;
		}
		else{
			ans = min(ans, zeroes);
			if(a[s] == 0) zeroes--;
			s++;
			e++;
		}
	}
	
	return ans;
}





//* Template 2 : 

int consistency2(int n){
	
	int k = 0;
	for(int i=0; i<n; i++) if(a[i] == 1) k++;
	if(k == 0) return -1;
	
	int s = 0, e = 0; 
	int zeroes = 0;
	int ans = INF;
	
	
	for(int i=0; i<n; i++){
		if(a[i] == 0) zeroes++;
		
		if(i-k>=0){
			if(a[i-k] == 0) zeroes--;
		}
		
		
		if(i-k+1>=0){
			ans = min(ans, zeroes);
		}
	}
	
	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;
	
	// cout << consistency1(n) << " " << practice(n) << endl;
	
	
}





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

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

    return 0;
}