John#789
Little John is playing a very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first, John has to eat several M&Ms of the same color. Then his opponent makes a turn, and so on. Each player must eat at least one M&M during their turn. If John (or his brother) eats the last M&M from the box, he is considered the loser and will have to buy a new candy box. Both players use optimal game strategy. John always starts first. You are given information about the M&Ms, and your task is to determine the winner of this game.
The first line of input contains a single integer — the number of test cases. The next pairs of lines describe the tests in the following format. The first line of each test contains an integer — the number of different M&M colors in the box. The next line contains integers A_i separated by spaces — the number of M&Ms of the -th color.
Constraints: 1 \leq T \leq 474, 1 \leq N \leq 47, 1 \leq A_i \leq 4747
Print lines, each containing information about the winner of the game. Print **"John"** if John will win the game, or **"Brother"** otherwise.
Example 1