#include<iostream>
#include<cstring>
using namespace std;
const int N=1010;
int f1[N][N],f2[N][N],n,a[N],ans1=1e9,ans2;
//f[i][j]表示为i到j区间合并最小值
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        a[i+n]=a[i];
    }
    int m=n*2;
     for(int i=1;i<=m;i++)a[i]+=a[i-1];
    memset(f1,0x3f,sizeof(f1));
    for(int i=1;i<=m;i++)f1[i][i]=0;
     for(int len=2;len<=n;len++)
     for(int i=1;(i+len-1)<=m;i++){
         int j=i+len-1;
          for(int k=i;k<=j-1;k++){
 f1[i][j]=min(f1[i][j],f1[i][k]+f1[k+1][j]+a[j]-a[i-1]);
f2[i][j]=max(f2[i][j],f2[i][k]+f2[k+1][j]+a[j]-a[i-1]);         
        } 
        
     }
         
    for(int i=1;i<=n;i++){
         ans1=min(ans1,f1[i][i+n-1]);
          ans2=max(ans2,f2[i][i+n-1]);
    }
cout<<ans1<<endl<<ans2;
    
    return 0;
}