#include <algorithm>
#include <cstdio>
#include <cstring> 
using namespace std;

const int N = 350;
const int M = 1500; 

int n;
int sum[N], m[N], dp[M][M], f[M][M];

int main() {
	memset(dp, 0x3f, sizeof dp);
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++) {
		scanf("%d", &m[i]);
		sum[i] = sum[i - 1] + m[i];
		dp[i][i] = 0, f[i][i] = 0;
	}
	
	for (int len = 2; len <= n; len ++) {
		for (int i = 1; i <= n - len + 1; i ++) {
			int j = i + len - 1;
			for (int k = i; k < j; k ++) {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1]);
                f[i][j] = max(f[i][j], f[i][k] + f[k + 1][j] + sum[j] - sum[i - 1]);
            }	
		} 	
	}
		
	printf("%d\n%d", dp[1][n], f[1][n]);
	
	return 0;
}

最小值不对，最大值是对的