#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 410;
int f[N][N],g[N][N],s[N];
int w[N];

int main()
{
    int n;cin >> n;
    for(int i = 1 ; i <= n ; i ++)
    {
        int x;cin >> x;
        w[i] = w[i + n] = x;
    }

    for(int i = 1; i <= 2 * n; i ++)s[i] = s[i - 1] + w[i];

    memset(f,0x3f,sizeof f);
    memset(g,-0x3f,sizeof g);

    for(int len = 1; len <= n; len ++)
        for(int l = 1; l + len - 1 < 2 * n; l ++)
        {
            int r = l + len - 1;
            if(len == 1)f[l][r] = g[l][r] = 0;
            else 
            for(int k = l; k < r; k ++)//这儿的写法和下面的分界点有关
            {
                f[l][r] = min(f[l][r], f[l][k] + f[k + 1][r] + s[r] - s[l - 1]);
                g[l][r] = max(g[l][r], g[l][k] + g[k + 1][r] + s[r] - s[l - 1]);
            }
        }

    int maxv = -0x3f3f3f3f,minv = 0x3f3f3f3f;
    for(int i = 1; i <= n; i ++)
    {
        maxv = max(maxv, g[i][i + n - 1]);
        minv = min(minv, f[i][i + n - 1]);
    }

    cout << minv << endl << maxv << endl;
    return 0;
}