#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

inline int min(int x,int y)

{

    if(x<y)return x;return y;

}

inline int max(int x,int y)

{

    if(y>x)return y;return x;

}

int a[];

int dp_max[][];

int dp_min[][];

int main()

{

    int n;

    scanf("%d",&n);

    memset(dp_max,,sizeof(dp_max));

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

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

    dp_min[i][j]=0x7fffffff;

    for(int i=;i<=n;i++)scanf("%d",a+i),a[i+n]=a[i];

    for(int i=;i<=n*;i++)a[i]+=a[i-];

    for(int i=n*-;i>=;i--)

    {

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

        {

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

            {

                dp_min[i][j]=min(dp_min[i][j],dp_min[i][k]+dp_min[k+][j]+a[j]-a[i-]);

                dp_max[i][j]=max(dp_max[i][j],dp_max[i][k]+dp_max[k+][j]+a[j]-a[i-]);

            }

        }

    }

    int minn=0x7fffffff;

    int maxx=-;

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

    {

        minn=min(dp_min[i][i+n-],minn);

        maxx=max(dp_max[i][i+n-],maxx);

    }

    printf("%d\n%d",minn,maxx);

    return ;

}