John
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 3 Accepted Submission(s) : 1
Problem Description
Little John is playing 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 has to make a turn. And so on. Please note that each player has to eat at least one M&M during his turn. If John (or his brother) will eat the last M&M from the box he will be considered as a looser and he will have to buy a new candy box.
Both of players are using optimal game strategy. John starts first always. You will be given information about M&Ms and your task is to determine a winner of such a beautiful game.
Input
<p>The first line of input will contain a single integer <b>T</b> – the number of test cases. Next <b>T</b> pairs of lines will describe tests in a following format. The first line of each test will contain an integer <b>N</b> – the amount of different M&M colors in a box. Next line will contain <b>N</b> integers <b>A<sub>i</sub></b>, separated by spaces – amount of M&Ms of <b>i</b>-th color.</p><p><b>Constraints:<br>1 <= T <= 474,<br>1 <= N <= 47,<br>1 <= A<sub>i</sub> <= 4747</b></p>
Output
<p>Output <b>T</b> lines each of them containing information about game winner. Print “<b>John</b>” if John will win the game or “<b>Brother</b>” in other case.</p>
Sample Input
2 3 3 5 1 1 1
Sample Output
John Brother
Source
PKU