#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  problem
    2-player game
    move: choose an element adjacent to 0, get score, change it to 0
*/

struct Stack {
  vector<Int> as, bs;
  void push(Int a) {
    for (; as.size() && as.back() >= a; ) {
      const Int a1 = as.back(); as.pop_back();
      if (!as.size()) {
        bs.push_back(a - a1);
        return;
      }
      const Int a2 = as.back(); as.pop_back();
      a = a - a1 + a2;
    }
    as.push_back(a);
  }
  void get(vector<Int> &goods, vector<Int> &bads) {
// cerr<<"[Stack::get] "<<as<<" "<<bs<<endl;
    goods.insert(goods.end(), as.begin(), as.end());
    bads.insert(bads.end(), bs.begin(), bs.end());
  }
};

int N;
vector<Int> A;

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    vector<Int> goods, bads;
    
    vector<int> cuts;
    for (int i = 0; i < N; ++i) if (!A[i]) {
      cuts.push_back(i);
    }
    const int cutsLen = cuts.size();
    assert(cutsLen >= 1);
    
    Stack f, g;
    for (int i = 0; i < cuts[0]; ++i) f.push(A[i]);
    f.get(goods, bads);
    for (int i = N; --i > cuts[cutsLen - 1]; ) g.push(A[i]);
    g.get(goods, bads);
    
    for (int j = 1; j < cutsLen; ++j) {
      vector<Int> as;
      for (int i = cuts[j - 1] + 1; i < cuts[j]; ++i) {
        Int a = A[i];
        for (; as.size() >= 2 && as[as.size() - 2] <= as.back() && as.back() >= a; ) {
          const Int a1 = as.back(); as.pop_back();
          const Int a2 = as.back(); as.pop_back();
          a = a - a1 + a2;
        }
        as.push_back(a);
      }
// cerr<<"deque "<<as<<endl;
      goods.insert(goods.end(), as.begin(), as.end());
    }
    
    sort(goods.begin(), goods.end(), greater<Int>{});
// cerr<<"goods = "<<goods<<endl;
// cerr<<"bads = "<<bads<<endl;
    
    Int ans = 0;
    int sig = +1;
    for (const Int good : goods) {
      ans += sig * good;
      sig = -sig;
    }
    for (const Int bad : bads) {
      ans += sig * bad;
    }
    
    Int sumA = 0;
    for (int i = 0; i < N; ++i) sumA += A[i];
    printf("%lld %lld\n", (sumA + ans) / 2, (sumA - ans) / 2);
  }
  return 0;
}