#include <iostream>
#include <vector>
#include <numeric>

using namespace std;
using ll = long long;

int N;
vector<int> a;

ll solvemin() {
    auto chk = [&](ll lim) -> bool {
        ll mn = 0ll, mx = 0ll;
        for (int i=1; i<=N; ++i) {
            ll pmn = mn;
            if (mn >= a[i])
                mn -= a[i];
            else if (mx < a[i])
                mn = a[i]-mx;
            else
                mn = (mn+a[i]) % 2;

            if (mx+a[i] <= lim) mx += a[i];
            else {
                ll rem = lim-pmn;
                if ((pmn+a[i] <= lim) || (a[i] <= mx+lim))
                    mx = lim - (rem+a[i])%2;
                else return false;
            }
        }
        return (mn==0);
    };

    ll lo = 0, hi = accumulate(a.begin(), a.end(), 0ll);
    while (lo+1 < hi) {
        ll mid = (lo+hi)/2;
        if (chk(mid))
            hi = mid;
        else
            lo = mid;
    }
    return hi;
}
ll solvemax() {
    vector<ll> pref(N+1, 0ll);
    for (int i=1; i<=N; ++i)
        pref[i] = pref[i-1] + (ll)a[i];
    ll ans = 0ll, tot = 0ll;
    for (int i=N; i>0; --i) {
        tot += a[i];
        ans = max(ans, min(pref[i-1], tot));
    }
    return ans;
}
int main() {
    ios::sync_with_stdio(false);
    cin >> N;
    a.assign(N+1, 0);
    for (int i=1; i<=N; ++i)
        cin >> a[i];
    
    cout << solvemin() << endl;
    cout << solvemax() << endl;
    return 0;
}