#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 7e5 + 10;
int n, d[N];
ll f[N], g[N];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &d[i]);
    f[n] = d[n]; g[n] = 0ll;
    for (int i = n - 1; i >= 1; i--)
    {
        if (f[i + 1] <= g[i + 1] + d[i]) f[i] = g[i + 1] + d[i], g[i] = f[i + 1]; 
        else                   f[i] = f[i + 1]     , g[i] = g[i + 1];
    }
    printf("%lld %lld\n", f[1], g[1]);
    return 0;
}