#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
	char c=getchar(); int ret=0,f=1;
	while (c<'0'||c>'9') {if(c=='-')f=-1;c=getchar();}
	while (c<='9'&&c>='0') {ret=ret*10+c-'0';c=getchar();}
	return ret*f;
}
int a[100005];
int s[10005];
int f[1005][1005],f1[1005][1005];
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int n;
	cin>>n;
	memset(f,127,sizeof(f));
	memset(f1,-12,sizeof(f));
	for(int i=1;i<=n;i++){  
        scanf("%d",&a[i]);  
        a[i+n]=a[i];  
        s[i]=s[i-1]+a[i]; 
		f1[i][i]=f[i][i]=0; 
    }
    for(int i=n+1;i<=2*n;i++){
    	s[i]+=s[i-1]+a[i];
   		f[i][i]=f[i][i]=0; 
	}
	for(int l=1;l<=n;l++){
		for(int i=1;i+l<2*n&&i<=n;i++){
			for(int k=i;k<i+l;k++){ 
				f[i][i+l]=min(f[i][k]+f[k+1][i+l]+s[i+l]-s[i-1],f[i][i+l]);
				f1[i][i+l]=max(f1[i][k]+f1[k+1][i+l]+s[i+l]-s[i-1],f1[i][i+l]);
			}
		}
	}
	int ans1=-1<<30,ans2=1<<30; 
	for(int i=1;i<=n;i++){
		ans2=min(ans2,f[i][i+n-1]);
		ans1=max(ans1,f1[i][i+n-1]);
	}
	cout<<ans2<<endl<<ans1<<endl;
	return 0;
}