#include<bits/stdc++.h>
using namespace std;
const int N = 210, M = N<<1, inf = 0x3f3f3f3f;
int n;
int f[M][M], g[M][M];
int s[M], w[M];
int main()
{
cin>>n;
for(int i=1; i<=n; ++i)
{
cin>>w[i];
w[i+n] = w[i];
}
//预处理前缀和(DP状态转移中用到的区间和)
for(int i=1; i<=n<<1; ++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 <= n<<1; ++l)//左端点
{
int r = l + len -1;//右端点
if(len==1) {f[l][r] = 0, g[l][r] = 0; continue;}//区间长度为1时特殊判断
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 MIN = inf, MAX = -inf;
for(int i=1; i<=n; ++i)
{
MIN = min(MIN, f[i][i+n-1]);
MAX = max(MAX, g[i][i+n-1]);
}
cout<<MIN<<'\n'<<MAX<<'\n';
return 0;
}