Entertainment in the gaming hall
Viktor Oleksandrovych recently introduced a new game at the game hall. This game uses 2n cards, and each card displays two numbers: a red number a_i and a blue number b_i. The game is played by two players, red and blue, who take turns picking cards, with the red player starting first. Initially, all cards are laid out on the table. During their turn, a player selects any card from the table and adds it to their stack. Once both players have collected n cards each, the scores are tallied. The red player sums up the red numbers on their cards, while the blue player sums up the blue numbers on theirs. The player with the higher total wins, and their score is the difference between their total and their opponent's total. If both totals are equal, the game is a draw.
Your task is to help the players determine who will win if both play optimally, and what the maximum score the winner can achieve will be.
Input
The first line contains the number 2n (2 ≤ 2n ≤ 2000). The following 2n lines each contain two integers: a_i and b_i (1 ≤ a_i, b_i ≤ 100000).
Output
On the first line of the output, print ruzha if the red player wins, blua if the blue player wins, or neniu if the game ends in a draw when both players play optimally.
If a player wins, print the maximum score they can achieve on the second line.