# Problem O

Exciting Tournament

A group of players compete in a no-holds-barred tournament.

Each player has a unique skill level (represented as an integer). In each game, two players play, and the player of higher skill level wins. The player of lower skill level is immediately eliminated from the tournament! The tournament continues until there is only one player left.

Due to scheduling constraints, each player has a limit on the maximum number of games they can play. Interestingly, this is the only constraint that the tournament bracket needs to meet. In other words, the bracket may not necessarily have the shape of a balanced binary tree, as long as every player plays at most their maximum number of games before getting eliminated or winning the entire tournament.

As a tournament organizer, you are free to choose any valid
bracket. Given the list of participants, you wonder how
exciting (or not exciting) the tournament can get. Concretely,
the *excitement of a game* is defined as the bitwise XOR
of the two playersâ€™ skill levels. The *excitement of the
tournament* is simply the sum of the *excitement* of
each game.

Compute the minimum and maximum possible *excitement*
values of the entire tournament.

## Input

The first line of input contains a single integer $n$ ($3 \le n \le 100$), which is the number of players in the tournament.

Each of the next $n$ lines contains two integers $s$ ($0 \le s < 2^{30}$) and $g$ ($2 \le g < n$). Each line describes a single player; $s$ is the skill level of the player, and the $g$ is the limit on the number of games that player can play.

## Output

Output two space-separated integers on a single line, which
are the minimum and maximum possible *excitement* values
of the entire tournament, minimum first.

Sample Input 1 | Sample Output 1 |
---|---|

4 41 2 13 2 36 3 17 3 |
94 110 |

Sample Input 2 | Sample Output 2 |
---|---|

6 66 5 628 4 216 5 78 4 230 5 74 3 |
882 2650 |