| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 2990 | Accepted: 1451 |
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 – 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 – the amount of different M&M colors in a box. Next line will contain N integers Ai, separated by spaces – amount of M&Ms of i-th 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
2 3 3 5 1 1 1
Sample Output
John Brother
思路：
情況1、
若所有堆裏的石頭數都是1，則堆的個數爲偶數時，必定是John贏；奇數個時，必定是Brother贏。這都沒得選，想不贏都不行。
情況2、
有一堆的個數大於1，其他堆的個數等於1。假如這堆個數爲n（n>1），那麼John可以選n-1和n個來控制這一步取完之後石頭數量爲1的堆的奇偶性，轉換成情況1。如果其他石頭數爲1的個數爲奇數，那John這裏就取n-1個；如果如果其他石頭數爲1的個數爲偶數，John這裏就取n個。所以John能夠讓自己必贏。
情況3、
代碼: