#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std;
const int N=1e6+5; typedef long long ll;
struct Node { int id,type; ll val; bool operator< (const Node& nd) const { return val<nd.val; } };
int n,a[N],lcnt,pre[N],nxt[N],tp; ll st[N],lis[N];
vector<ll> vec[N]; int vcnt,pl[N],pr[N];
priority_queue<Node> q;
void solve(){
    if(lcnt==0) return;
    tp=0; For(i,1,lcnt) { st[++tp]=lis[i]; while( tp>=3 && st[tp-1]>st[tp-2] && st[tp-1]>st[tp] ) { ll x=st[tp-2]+st[tp]-st[tp-1]; tp-=3; st[++tp]=x; } }
    vec[++vcnt].resize(tp+1); pl[vcnt]=1; pr[vcnt]=tp; For(i,1,tp) vec[vcnt][i]=st[i];
}
signed main(){
    cin>>n; ll tt=0; For(i,1,n) { cin>>a[i]; tt+=a[i]; }
    int s=0; For(i,1,n) if(a[i]==0) { s=i; break; }
    For(i,s+1,n){
        if(a[i]) lis[++lcnt]=a[i];
        else { solve(); lcnt=0; }
    }
    lis[++lcnt]=-1e18;
    For(i,1,s-1) lis[++lcnt]=a[i];
    solve();
    // For(i,1,vcnt){
    //     For(j,pl[i],pr[i]) cout<<vec[i][j]<<' ';
    //     cout<<endl;
    // }
    For(i,1,vcnt) { q.push(Node{i,0,vec[i][pl[i]]}); q.push(Node{i,1,vec[i][pr[i]]}); }
    ll ans=0; int sgn=1; while(q.size()){
        Node nd=q.top(); q.pop(); int o=nd.id;
        if(pl[o]>pr[o]) continue;
        if(nd.val<=-1e18) break;
        if(nd.type==0) { ans+=sgn*vec[o][pl[o]++]; q.push(Node{o,0,vec[o][pl[o]]}); }
        else { ans+=sgn*vec[o][pr[o]--]; q.push(Node{o,1,vec[o][pr[o]]}); }
        sgn=-sgn;
    }
    // cout<<"ans="<<ans<<endl;
    cout<<(tt+ans)/2<<' '<<(tt-ans)/2<<'\n';
    cerr<<"Time = "<<clock()<<" ms"<<endl;
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO