【CF MEMSQL 3.0 C. Pie Rules】

time limit per test 2 seconds

memory limit per test 256 megabytes

input standard input

output standard output

You may have heard of the pie rule before. It states that if two people wish to fairly share a slice of pie, one person should cut the slice in half, and the other person should choose who gets which slice. Alice and Bob have many slices of pie, and rather than cutting the slices in half, each individual slice will be eaten by just one person.

The way Alice and Bob decide who eats each slice is as follows. First, the order in which the pies are to be handed out is decided. There is a special token called the "decider" token, initially held by Bob. Until all the pie is handed out, whoever has the decider token will give the next slice of pie to one of the participants, and the decider token to the other participant. They continue until no slices of pie are left.

All of the slices are of excellent quality, so each participant obviously wants to maximize the total amount of pie they get to eat. Assuming both players make their decisions optimally, how much pie will each participant receive?

Input

Input will begin with an integer N (1 ≤ N ≤ 50), the number of slices of pie.

Following this is a line with N integers indicating the sizes of the slices (each between 1 and 100000, inclusive), in the order in which they must be handed out.

Output

Print two integers. First, the sum of the sizes of slices eaten by Alice, then the sum of the sizes of the slices eaten by Bob, assuming both players make their decisions optimally.

Examples

input

3
141 592 653

output

653 733

input

5
10 21 10 21 10

output

31 41

Note

In the first example, Bob takes the size 141 slice for himself and gives the decider token to Alice. Then Alice gives the size 592 slice to Bob and keeps the decider token for herself, so that she can then give the size 653 slice to herself.

【翻译】有n个不同美味值的派，Alice和Bob从1开始吃到n。对于第i个派，拥有令牌的人可以做出抉择：①吃这个派获得美味值，但是到下一个派，令牌就给另一个人。②让对方吃，自己保留令牌。已知Bob初始持有令牌，并且两人都采取最优策略，请分别输出Alice和Bob最后得到的美味值。

题解：

     ①从题目发现当前的抉择只会依据有令牌的那个人。

     ②使用DP：f[i]表示当前该吃第i个，拥有令牌的人吃到的最大美味值。

     ③由于只知道i==1时Bob拥有令牌，因此倒推。

     ④转移方程式：f[i]=max(f[i+1],sum(i+1~n)-f[i+1]+val[i]) (表示不吃与吃)

#include<stdio.h>
#include<algorithm>
#define go(i,a,b) for(int i=a;i<=b;i++)
#define ro(i,a,b) for(int i=a;i>=b;i--)
int n,f[55],a[55],sum;
int main()
{
	scanf("%d",&n);
	go(i,1,n)scanf("%d",a+i);
	ro(i,n,1)f[i]=std::max(f[i+1],sum-f[i+1]+a[i]),sum+=a[i];
	printf("%d %d\n",sum-f[1],f[1]);return 0;
}//Paul_Guderian