#include<iostream>

#include<queue>

#include<cmath>

#include<cstdio>

#include<cstring>

using namespace std;

int f2[][],f1[][];

int s[],n;

int a[];

int ans1,ans2;

int sum(int left,int right)

{

    return s[right]-s[left-];

}

int main()

{

    memset(f1,-,sizeof(f1));

    memset(f2,0x3f,sizeof(f2));

    int i,j;

    scanf("%d ",&n);

    for(i=;i<=n;i++)

    {

        scanf("%d",&a[i]);

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

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

        f1[i][i]=;

        f2[i][i]=;

    }

    for(i=n+;i<=n*;i++)

    {

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

    f1[i][i]=;

    f2[i][i]=;

    }

    int l,k;

    for(l=;l<=n;l++)

    for(i=;i<=*n-l;i++)

    {

        j=i+l-;

        for(k=i;k<j;k++)

        {

            f1[i][j]=max(f1[i][k]+f1[k+][j],f1[i][j]);

            f2[i][j]=min(f2[i][k]+f2[k+][j],f2[i][j]);

        }

        f1[i][j]+=sum(i,j);

        f2[i][j]+=sum(i,j);

    }

    ans1=-;

    ans2=0x3f3f3f3f;

    for(i=;i<=n;i++)

    {

        ans1=max(ans1,f1[i][i+n-]);

        ans2=min(ans2,f2[i][i+n-]);

     }

     printf("%d\n%d ",ans2,ans1);

     return ;

}