#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 5;

char buf[1 << 23], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1 ++ )
int read() {
    int s = 0, w = 1; char ch = getchar();
    while(!isdigit(ch)) { if(ch == '-') w = -1; ch = getchar(); }
    while(isdigit(ch)) s = s * 10 + (ch ^ 48), ch = getchar();
    return s * w;
}

vector<int> vec, num;
int a[N], stk[N];
int n, top, dif, sum;

void append(int x) {
    if(top <= 1) stk[++ top] = x;
    else {
        if(stk[top - 1] <= stk[top] && x <= stk[top])
            // cout << stk[top - 1] << " " << stk[top] << " " << x << endl,
            stk[top - 1] += x - stk[top], -- top;
        else stk[++ top] = x;
    }
}

void work(int l, int r) {
    if(l > r) return ;
    // cout << l << " " << r << endl;

    top = 0;
    if(r == n) for(int i = r; i >= l; -- i) append(a[i]);
    else for(int i = l; i <= r; ++ i) append(a[i]);
    // for(int i = 1; i <= top; ++ i) cout << stk[i] << " "; puts("");

    int s = 0, ptr = 1;
    if(l == 1 || r == n) {
        while(ptr + 1 <= top && stk[ptr] >= stk[ptr + 1])
            s += stk[ptr] - stk[ptr + 1], ptr += 2;
        if(ptr != 1) num.push_back(s);
    }
    
    for(int i = ptr; i <= top; ++ i)
        num.push_back(stk[i]);    
}

signed main() {
    n = read();
    vec.push_back(0);
    for(int i = 1; i <= n; ++ i) {
        a[i] = read(), sum += a[i];
        if(a[i] == 0) vec.push_back(i);
    }
    vec.push_back(n + 1);

    for(int i = 1; i < (int)vec.size(); ++ i)
        work(vec[i - 1] + 1, vec[i] - 1);
    // for(auto v : num) cout << v << " "; puts("");
    sort(num.begin(), num.end(), greater<int>());

    for(int i = 0; i < (int)num.size(); ++ i)
        if(i & 1) dif -= num[i];
        else dif += num[i];
    // for(int i = 0; i < (int)num.size(); ++ i)
    //     if(i & 1) b += num[i];
    //     else a += num[i];
    printf("%lld %lld\n", (sum + dif) / 2, (sum - dif) / 2);
    return 0;
}