/*

*/
#include<iostream>
#include<cstdio>
#include<memory.h>

using namespace std;
#define int long long

int dp[305][305],dp2[305][305];
int n,a[305],sum[305];
int ans1=0x3f3f3f3f+1,ans2;
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i],a[i+n]=a[i];
	for(int i=1;i<=n*2;i++)
		sum[i]=sum[i-1]+a[i];
	memset(dp,0x3f,sizeof dp);
	for(int i=1;i<=n*2;i++) dp[i][i]=0;
	for(int len=2;len<=n;len++)
		for(int l=1;l+len-1<=n*2;l++)
		{
			int r=l+len-1;
			for(int k=l;l<r;k++)
			{
				dp[l][r]=min(dp[l][r],
				dp[l][k]+dp[k+1][r]+sum[r]-sum[l-1]),
				dp2[l][r]=max(dp2[l][r],
				dp2[l][k]+dp2[k+1][r]+sum[r]-sum[l-1]);
			}
		}
	for(int i=1;i<=n;i++)
		ans1=min(ans1,dp[i][i+n-1]),
		ans2=max(ans2,dp[i][i+n-1]);
	cout<<ans1<<endl<<ans2;
	return 0;
}