#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n; // 5

    int b[n+1]; // 1-based indexing
    for(int i = 1; i <= n; i++)
    {
        // index          1 2 3 4 5 
        cin >> b[i]; // 2 6 2 3 5 
    }

    int start = 1;
    int end = n;

    bool reversed = false; // Initially, no reversal // In starting no Number is reversed so we declare it as false 
    int turn = 0;
    int p1 = 0;
    int p2 = 0;
    int selected = 0;

    while(start <= end)
    {
        if(turn % 2 == 0) // p1's turn
        {
            if(reversed == false) // Initially, no reversal // In starting no Number is reversed so we declare it as false 
            {
                p1 = p1 + b[start];
                selected = b[start];
                start++;
            }
            else
            {
                p1 = p1 + b[end];
                selected = b[end];
                end--;
            }
        }
        else // p2's turn
        {
            if(reversed == false) // Initially, no reversal // In starting no Number is reversed so we declare it as false 
            {
                p2 = p2 + b[start];
                selected = b[start];
                start++;
            }
            else
            {
                p2 = p2 + b[end];
                selected = b[end];
                end--;
            }
        }

        // Reverse the direction if the selected number is even
        if(selected % 2 == 0)
        {
            reversed = !reversed;
        }

        turn++;
    }

    cout << "p1: "<< p1 << " p2: " << p2 << endl;
}