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

typedef long long ll;


bool check(ll M, int n, const vector<ll>& a, const vector<ll>& S) {
    if (M < a[0] || M < a[n - 1]) return false;
    
    
    ll L = a[0], R = a[0];
    
    for (int i = 1; i < n - 1; ++i) {
        ll val = a[i];
        ll p = S[i + 1] % 2;
        ll ntL;
        if (val > R) ntL = val - R;
        else if (val < L) ntL = L - val;
        else ntL = p; 
        if (ntL % 2 != p) ntL++;
        ll ntR = R + val;
        if (ntR > M) {
            ntR = M;
            if (ntR % 2 != p) ntR--;
        }

        if (ntL > ntR) return false;
        L = ntL;
        R = ntR;
    }

    return (a[n - 1] >= L && a[n - 1] <= R);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;

    vector<ll> a(n);
    vector<ll> S(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        S[i + 1] = S[i] + a[i];
    }

    ll mx = 0;
    ll totalSum = S[n];
    for (int i = 1; i < n; ++i) {
        ll curr = min(S[i], totalSum - S[i]);
        if (curr > mx) mx = curr;
    }

    ll l = max(a[0], a[n - 1]), r = mx, mn = mx;
    while (l <= r) {
        ll mid = l+(r-l)/2;
        if (check(mid, n, a, S)) {
            mn = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }

    cout << mn << "\n" << mx << endl;

    return 0;
}