#include<bits/stdc++.h>
using namespace std;
const int N = 4e2+10;
int n,f[N][N],s[N],a[N];
int main(){
	scanf("%d",&n);
	for(int i=1; i<=n; i++){
		scanf("%d",&a[i]);
		s[i] = s[i-1]+a[i];
	}
	memset(f,0x3f,sizeof(f));
	for(int len=1; len<=n; len++){
		for(int i=1; i+len-1<=n; i++){
			int j = i+len-1;
			if( len==1 ){
				f[i][j] = 0;
				continue;
			}
			for(int k=i; k<j; k++)
				f[i][j] = min(f[i][j],f[i][k]+f[k+1][j]+s[j]-s[i-1]);
		}
	}
	printf("%d\n",f[1][n]);
	memset(f,-0x3f,sizeof(f));
	for(int len=1; len<=n; len++){
    for(int i=1; i+len-1<=n; i++){
			int j = i+len-1;
			if( len==1 ){
				f[i][j] = 0;
				continue;
			}
			for(int k=i; k<j; k++)
				f[i][j] = max(f[i][j],f[i][k]+f[k+1][j]+s[j]-s[i-1]);
		}
	}
	printf("%d",f[1][n]);
	return 0;
}