#include<iostream>
using namespace std;
int n;
int w[105],dp[105][105],presum[105];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>w[i];
presum[i]=presum[i-1]+w[i];
}
for(int len=1;len<=n;len++){
for(int i=1;i+len-1<=n;i++){
int j=i+len-1;
dp[i][j]=max(w[i]+presum[j]-presum[i]-dp[i+1][j],w[j]+presum[j-1]-presum[i-1]-dp[i][j-1]);
}
}
cout<<dp[1][n]<<" "<<presum[n]-dp[1][n]<<endl;
return 0;
}