#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,a[1000010],b[1000010],cnt=0,st[1000010],top=0,tot=0,sum=0,ans=0;
void solve(ll l,ll r){
	if(l>r) return;
	top=0;
	fr(i,l,r){
		st[++top]=a[i];
		while(top>2&&st[top-1]>=st[top]&&st[top-1]>=st[top-2]){
			top-=2;
			st[top]=st[top]+st[top+2]-st[top+1];
		}
	}
	if(l==1){
		ll now=1;
		while(now<top&&st[now]>=st[now+1]){
			if(tot&1) ans+=st[now]-st[now+1];
			else ans-=st[now]-st[now+1];
			now+=2;
		}
		fr(i,now,top) b[++cnt]=st[i];
	}
	else if(r==n){
		while(top>1&&st[top]>=st[top-1]){
			if(tot&1) ans+=st[top]-st[top-1];
			else ans-=st[top]-st[top-1];
			top-=2;
		}
		fr(i,1,top) b[++cnt]=st[i];
	}
	else{
		fr(i,1,top) b[++cnt]=st[i];
	}
}
int main(){
	n=read();
	fr(i,1,n) a[i]=read();
	fr(i,1,n){
		sum+=a[i];
		if(a[i]) tot++;
	}
	ll lst=0;
	fr(i,1,n){
		if(!a[i]){
			solve(lst+1,i-1);
			lst=i;
		}
	}
	solve(lst+1,n);
	if(!lst){
		write(0);
		return 0;
	}
	sort(b+1,b+cnt+1);
	pfr(i,cnt,1){
		if((cnt-i)&1) ans-=b[i];
		else ans+=b[i];
	}
	writesp((sum+ans)>>1);
	write((sum-ans)>>1);
}