#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 x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


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




vector<int> a;


//* Greedy soln
int consistency1(int n){
	
    int maxi = -INF;
    int sum = 0;
    for(int i=0; i<n; i++){
    	sum += a[i];
    	maxi = max(maxi, sum);
    	if(sum < 0) sum = 0;
    }
    
    return maxi;
}


//* DP + Greedy soln 
int consistency2(int n){
    
    int last = 0;
    int maxi = -INF;
    for(int i=0; i<n; i++){
    	int curr = max(last+a[i] , a[i]);
    	last = curr;
    	maxi = max(maxi, curr);
    }


    return maxi;    
}


//* Bruteforce optimization 
int consistency3(int n){
    int maxi = -INF;
	
	int sum = 0;
	int minSum = 0;
	
	for(int i=0; i<n; i++){
		sum += a[i];
		maxi = max(maxi, sum - minSum);
		
		minSum = min(minSum, sum);
	}

    return maxi;    
}







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