Welcome to ZOJ
Information
Select Problem
Runs
Ranklist
ZOJ Problem Set - 1880
Tug of War

Time Limit: 5 Seconds      Memory Limit: 32768 KB

A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than 1; the total weight of the people on each team should be as nearly equal as possible.


Input

The first line of input contains n the number of people at the picnic. n lines follow. The first line gives the weight of person 1; the second the weight of person 2; and so on. Each weight is an integer between 1 and 450. There are at most 100 people at the picnic.

Input contains multiple test cases. Process to the end of file.


Output

Your output for each test case will be a single line containing 2 numbers: the total weight of the people on one team, and the total weight of the people on the other team. If these numbers differ, give the lesser first.


Sample Input

3
100
90
200


Sample Output


190 200


Source: University of Waterloo Local Contest 2000.09.30
Submit    Status