#include <bits/stdc++.h>
using namespace std;

int read() {
    int x = 0; char ch = getchar();
    while (ch < '0') ch = getchar();
    while (ch >= '0') x = x * 10 + ch - 48, ch = getchar();
    return x;
}

const int N = 1e6 + 3;
const long long inf = 1e17;
int n, m, pos, top, cnt, a[N];
long long ans, sum, q[N], b[N];

void in(long long x) {
	q[++top] = x;
	while (top > 2 && q[top - 1] == max({q[top], q[top - 1], q[top - 1]})) {
		top -= 2;
		q[top] += q[top + 2] - q[top + 1];
	}
}
void out() {
	while (top) b[++cnt] = q[top--];
}

int main() {
    n = read();
    for (int i = 1; i <= n; i++) {
        a[i] = read();
        if (a[i]) {
            sum += a[i], m++;
            if (pos) in(a[i]);
            continue;
        }
		out();
		if (!pos) pos = i;
    }
    in(-inf);// 塞个 -inf 把开头接结尾连成环
    for (int i = 1; i < pos; i++) in(a[i]);
	out();

    sort(b + 1, b + 1 + cnt);
    for (int i = cnt; i; i--) {
		ans += cnt - i & 1 ? -b[i] : b[i];
	}
    ans += m & 1 ? -inf : inf;
	printf("%lld %lld\n", sum + ans >> 1, sum - ans >> 1);
	return 0;
}