#include<bits/stdc++.h>

 using namespace std;

 typedef unsigned int ui;

 typedef long long ll;

 typedef unsigned long long ull;

 #define pf printf

 #define mem(a,b) memset(a,b,sizeof(a))

 #define prime1 1e9+7

 #define prime2 1e9+9

 #define scand(x) scanf("%llf",&x)

 #define f(i,a,b) for(int i=a;i<=b;i++)

 #define scan(a) scanf("%d",&a)

 #define dbg(args) cout<<#args<<":"<<args<<endl;

 #define pb(i) push_back(i)

 #define ppb(x) pop_back(x)

 #define inf 0x3f3f3f3f

 #define maxn 1005

 int n,m,t,max_ans,min_ans=inf,a[maxn],dp1[maxn][maxn],dp2[maxn][maxn],b[maxn];

 int dfs1(int l,int r)//max

 {

     if(l==r)return ;

     if(dp1[l][r])return dp1[l][r];

     if(r==l+)return a[l]+a[l+];

     int res=;

     f(i,l,r-)

     {

         res=max(res,dfs1(l,i)+dfs1(i+,r)+b[r]-b[l-]);

     }

     return dp1[l][r]=res;

 }

 int dfs2(int l,int r)//min

 {

     if(l==r)return ;

     if(dp2[l][r]!=inf)return dp2[l][r];

     if(r==l+)return a[l]+a[l+];

     int res=inf;

     f(i,l,r-)

     {

         res=min(res,dfs2(l,i)+dfs2(i+,r)+b[r]-b[l-]);

     }

     return dp2[l][r]=res;

 }

 int main()

 {

     //freopen("input.txt","r",stdin);

     //freopen("output.txt","w",stdout);

     std::ios::sync_with_stdio(false);

     scan(n);

     mem(dp1,);

     mem(dp2,inf);

     max_ans=-inf;

     min_ans=inf;

     f(i,,n)

     {

         scan(a[i]);

         a[i+n]=a[i];

      }

      f(i,,*n)

      {

          b[i]=b[i-]+a[i];

      }

      f(i,,n)

      {

          max_ans=max(max_ans,dfs1(i,n+i-));

          min_ans=min(min_ans,dfs2(i,n+i-));

      }

      pf("%d\n%d",min_ans,max_ans);

  }