#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

int n;
int m;
int f1[5010][5010];
int f2[5010][5010];
int sum[5010];
int a[5010]; 

int main()
{
	cin>>n;
	for(int i=1;i<=n<<1;i++){
		if(i<=n){
			cin>>a[i];
			a[i+n]=a[i];
		}
		sum[i]=sum[i-1]+a[i];
	}
	for(int h=1;h<n;h++){
		for(int i=1,j=i+h;i<=(n<<1)&&j<=(n<<1);i++,j=i+h){
			f2[i][j]=0x3f3f3f;
			for(int k=i;k<j;k++){
				f1[i][j]=max(f1[i][j],f1[i][k]+f1[k+1][j]+sum[j]-sum[i-1]);
				f2[i][j]=min(f2[i][j],f2[i][k]+f2[k+1][j]+sum[j]-sum[i-1]);
			}
		}
	}
	int maxn;
	int minn=0x3f3f3f;
	for(int i=1;i<=n;i++){
		maxn=max(f1[i][i+n-1],maxn);
		minn=min(f2[i][i+n-1],minn);
	}
	cout<<minn<<endl<<maxn;
	return 0;
}