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

int consistency1(int n){
	if(n==1 && a[0] < 0) return 1;
	
	
	vector<int> dp(n+1, 0);
	dp[0] = 1;
	if(a[0] < 0) dp[1] = 1;
	
	for(int i=2; i<=n; i++){
		
		int j = i-1;
		int negCt = a[i-1]<0 ? 1 : 0;
		
		while(j>=0){
			
			if(negCt >= 1){
				dp[i] += dp[j];
			}
			
			if(j-1>=0){
				if(a[j-1] < 0) negCt++;
			}
			j--;
		}
	}
	
	return dp[n];

}






int consistency2(int n){
	if(n==1 && a[0] < 0) return 1;
	
	int lastNeg = -1;
	
	vector<int> dp(n+1, 0);
	vector<int> prefixDp(n+1, 0);
	
	dp[0] = 1;
	prefixDp[0] = 1;
	
	if(a[0] < 0){
		dp[1] = 1;
		lastNeg = 0;
	}
	prefixDp[1] = dp[0] + dp[1];
	
	
	for(int i=2; i<=n; i++){
		
		if(a[i-1]<0) lastNeg = i-1;
		
		if(lastNeg != -1)	dp[i] = prefixDp[lastNeg];
		
		prefixDp[i] = prefixDp[i-1] + dp[i];
		
	}
	
	return dp[n];

}







int consistency3(int n){
	if(n==1 && a[0] < 0) return 1;
	
	int ans = 0;
	int sum = 0;
	
	int lastNeg = -1;
	
	for(int i=0; i<n; i++){

		if(a[i] < 0){
			if(lastNeg == -1){
				ans = 1;			
				sum = 1;
				lastNeg = i;
			}
			else{
				ans = sum;
			}
		}
		sum += 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) << " " << consistency3(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;
}