

JohnTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8287 Accepted Submission(s): 4706 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 The first line of input will contain a single integer T ¨C the number of test cases. Next T pairs of lines will describe tests in a following format. The first line of each test will contain an integer N ¨C the amount of different M&M colors in a box. Next line will contain N integers Ai, separated by spaces ¨C amount of M&Ms of ith color. Constraints: 1 <= T <= 474, 1 <= N <= 47, 1 <= Ai <= 4747 Output Output T lines each of them containing information about game winner. Print ˇ°Johnˇ± if John will win the game or ˇ°Brotherˇ± in other case. Sample Input
Sample Output
Source  
