#include <bits/stdc++.h>

const int maxn = 205;
int n,f[maxn][maxn],sum[maxn];

int main() {
	freopen("game1.in","r",stdin);
	freopen("game1.out","w",stdout);
	scanf("%d",&n);
	memset(f , -0x3f , sizeof(f));
	for(int i = 1;i <= n;++ i)
		scanf("%d",&sum[i]),f[i][i] = sum[i],sum[i] += sum[i - 1];
	for(int len = 2;len <= n;++ len) {
		for(int i = 1;i + len - 1 <= n;++ i) {
			int j = i + len - 1;
			f[i][j] = std::max(-f[i][j - 1] , -f[i + 1][j]) + sum[j] - sum[i - 1];
		}
	}
	printf("%d %d\n",f[1][n],sum[n] - f[1][n]);
	return 0;
}