#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************



vector<int> a;


int consistency(int n) {
	
	int s = 0, e = n-1;
	int p1 = 0, p2 = 0;
	
	bool isReversed = false;
	int turn = 1; //* a's turn 
	
	while(s<=e){
		int ele = -1;
		if(isReversed){
			//* Consume from end
			ele = a[e];
			e--;
		}
		else{
			//* Consume normal i.e. from s
			ele = a[s];
			s++;
		}
		
		if(!(ele & 1)){
			isReversed = !isReversed;
		}
		if(turn) p1 += ele;
		else p2 += ele;
		turn ^= 1;
	}
	
	return  p1 - p2;

}












int practice(int n) {
	
	int s = 0, e = n-1;
	bool turn = 1;
	bool isRev = false;
	
	int p1 = 0, p2 = 0;
	
	while(s<=e){
		
		int val = -1;
		if(isRev){
			val = a[e];
			e--;
		}
		else {
			val = a[s];
			s++;
		}
		
		if(!(val&1)){
			isRev = !isRev;
		}
		
		if(turn){
			p1 += val;
		}
		else p2 += val;
		
		turn ^= 1;
	
		
	}
	
	return p1-p2;

}



void solve() {
    
    int n;
    cin >> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    // cout << consistency(n) << endl;
    
    
    cout << consistency(n) << " -> " << practice(n) << endl;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    while (t--) {
        solve();
    }

    return 0;
}