Problem Statement
There is an array A of size N. Alex and Bob play a game on it with Alex moving first and the players playing their turns alternately.
In each turn, the length of the array decreases by 1 because of following operation that the player performs:
1. If the length of array is odd, the middle number is removed from array.
2. If the length is even, the player has a choice of removing either of the middle two elements.
The value of removed element is added to the score of the current player.
At end, the winner is decided by the one having maximum score. If both have same score at end, we allow Alex to win as he is the inventor of this game.
Both players play optimally.
Print the winner of the game and the absolute difference between their scores after the game ends.
Constraints
2<=N<=2,00,000
0<=A[i]<=109
Input Format
First line contains an integer N, denoting the size of array.
Next line contains N space separated natural numbers, denoting the array A.
Output Format
In a single line, print the winner followed by a single integer denoting the absolute value of the difference between their scores.
Since all elements are same, both have a score of 2 at end. So Alex wins with the absolute difference between their scores as 0.
