John

Little John is playing a very funny game with his younger brother. There is one big box filled with colored candies. First John must eat several candies of the same color. Then his opponent takes a turn, and so on, alternating. Note that on each turn a player must eat at least one candy, and all candies eaten in a single turn must be of the same color. Whoever eats the last candy from the box is the loser and has to buy a new candy box.

Both players use an optimal strategy, and John always goes first. Given information about the candies, determine the winner of the game.

The first line contains a single integer $T$ -- the number of test cases. Then $T$ tests follow, each described by two lines. The first line of each test contains an integer $N$ -- the number of different candy colors in the box. The next line contains $N$ integers $A_i$, separated by spaces, where $A_i$ is the number of candies of the $i$-th color.

• $1 \le T \le 474$
• $1 \le N \le 47$
• $1 \le A_i \le 4747$

For each test case, output the winner on its own line. Print John if John wins the game, or Brother otherwise.