#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair
#define ins insert
#define chkmn(x,y) (x)=min((x), (y))
#define chkmx(x,y) (x)=max((x), (y))

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

using ll = long long;
using ull = unsigned long long ;
using ld = long double ;
using str = string;
//using ordered_set=tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>;

const double PI=acos(-1);
const ll INF = 1LL<<62;
const ll MINF = -(1LL<<62);

template<typename T> T getint() {
    T val=0;
    char c;
    
    bool neg=false;
    while((c=gc()) && !(c>='0' && c<='9')) {
        neg|=c=='-';
    }

    do {
        val=(val*10)+c-'0';
    } while((c=gc()) && (c>='0' && c<='9'));

    return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)


int main() {
    IO;
    int n;
    cin>>n;
    vector<ll> a(n);
    for(int i=0;i<n;++i) cin>>a[i];
    ll sum=accumulate(all(a), 0LL)/2;
    ll mn=1LL<<60, mx=0, curr=0;
    for(int i=0;i<n;++i) {
        ll can_up=min(a[i], sum);
        ll can_down=min(curr, a[i]-can_up);
        curr+=can_up-can_down;
        chkmx(mx, curr);
        sum-=can_up;
    }

    auto test=[&](ll currMn) -> bool {
        bool ok=true;
        ll sum=accumulate(all(a), 0LL)/2;
        ll curr=0;
        for(int j=0;j<n && ok;++j) {
            ll can_up=min({a[j], sum, (currMn+a[j]-curr)/2});
            ll can_down=min(curr, a[j]-can_up);
            ok&=can_up+can_down==a[j] && can_up>=0 && can_down>=0;
            if(j==0) ok&=can_down==0;
            if(j==n-1) ok&=can_up==0;
            curr+=can_up-can_down;
            sum-=can_up;
        }
        return ok;
    };

    for(ll i=60;i>=0;i--) {
        ll currMn = mn - (1LL<<i);
        if(currMn>0 && test(currMn)) {
            mn=currMn;
        }
    }

    cout<<mn<<"\n";
    cout<<mx<<"\n";
    
    return 0;
}