#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) {
	
	vector<int> pMaxiDp(n);
	
	int maxi = -INF;
	int last = 0;
	for(int i=0; i<n; i++){
		int curr = max(last + a[i], a[i]);
		last = curr;
		maxi = max(maxi, curr);
		pMaxiDp[i] = maxi;
	}
	
	
	vector<int> sDp(n+1, 0);
	
	for(int i=n-1; i>=0; i--){
		sDp[i] = max(sDp[i+1] + a[i], a[i]);
	}
	
	
	int ans = -INF;
	for(int i=0; i<=n-2; i++){

		for(int j=i+1; j<=n-1; j++){
			int sum = pMaxiDp[i] + sDp[j];
			
			ans = max(ans , sum );
		}
	}
	
	return ans;

}






int consistency2(int n) {
	
	vector<int> pMaxiDp(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);
		pMaxiDp[i] = maxi;
	}
	
	
	vector<int> sMaxiDp(n);
	last = 0;
	maxi = -INF;
	
	for(int i=n-1; i>=0; i--){
		int curr = max(last + a[i], a[i]);
		last = curr;
		maxi = max(maxi, curr);
		sMaxiDp[i] = maxi;
	}
	
	int ans = -INF;
	for(int i=0; i<n-1; i++){
		ans = max(ans, pMaxiDp[i] + sMaxiDp[i+1]);
	}
	
	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;
}