#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int n;
int v[100000];
int f[1000][1000];
int g[1000][1000];
int main(){
    cin >>n;
    memset(f,0x3f,sizeof(f));
    memset(g,-0x3f,sizeof(g));
    for(int i=1;i<=n;i++){
        cin >>v[i]; 
        v[i+n]=v[i];
    }
    for(int i=1;i<=2*n;i++){
    	v[i]+=v[i-1];
    	f[i][i]=0;
        g[i][i]=0;
	}
    for(int len=2;len<=n;len++){
        for(int i=1;i+len-1<=2*n;i++){
            int j=i+len-1;
            for(int k=1;k<j;k++){
                f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]+v[j]-v[i-1]);
                g[i][j]=max(g[i][j],g[i][k]+g[k+1][j]+v[j]-v[i-1]);
            }
        }
    } 
    int maxx=-1;
    int minn=0x3f;
    for(int i=1;i<=n;i++){
    	minn=min(minn,f[i][i+n-1]);
    	maxx=max(maxx,g[i][i+n-1]);
	}
    cout <<minn<<endl<<maxx;
    return 0;
}