Codeforce Round #223 Div2 A

A. Sereja and Dima

time limit per test 1 second

memory limit per test 256 megabytes

 

Sereja and Dima play a game. The rules of the game are very simple. The players have n cards in a row. Each card contains a number, all numbers on the cards are distinct. The players take turns, Sereja moves first. During his turn a player can take one card: either the leftmost card in a row, or the rightmost one. The game ends when there is no more cards. The player who has the maximum sum of numbers on his cards by the end of the game, wins.

Sereja and Dima are being greedy. Each of them chooses the card with the larger number during his move.

Inna is a friend of Sereja and Dima. She knows which strategy the guys are using, so she wants to determine the final score, given the initial state of the game. Help her.

Input

The first line contains integer n (1 ≤ n ≤ 1000) — the number of cards on the table. The second line contains space-separated numbers on the cards from left to right. The numbers on the cards are distinct integers from 1 to 1000.

Output

On a single line, print two integers. The first number is the number of Sereja's points at the end of the game, the second number is the number of Dima's points at the end of the game.

Sample test(s)

Input

4 
4 1 2 10

Output

12 5

Input

7 
1 2 3 4 5 6 7

Output

16 12

Note

In the first sample Sereja will take cards with numbers 10 and 2, so Sereja's sum is 12. Dima will take cards with numbers 4 and 1, so Dima's sum is 5.

#pragma comment(linker,"/STACK:102400000,102400000")
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1000005
int n, m;
int b, w, x, c, y;
//c--;
//b-=x;b>=x;
//a--;b=w-(x-b);b<x;
int a[maxn];
int main(){
    int t = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; i++){
        scanf("%d", &a[i]);
    }
    int l = 0, r = n - 1;
    int flag = 1;
    x = y = 0;
    while (l <= r){
        if (a[l]>a[r])t = a[l++];
        else t = a[r--];
        if (flag > 0)x += t;
        else y += t;
        flag = -flag;
    }
    printf("%d %d\n", x, y);
    return 0;
}