Little John is playing a very funny game with his younger brother. There is a candy box filled with candy of two different colors. At first John has to eat several candys of the same color or the same number candys of two different colors(zero is illegal). Then his younger brother has to make a turn. And so on. Please note that each player has to eat at least one candy during his turn. Who eats the last candy from the box will be considered as a loser and has to buy another new candy box.
Both players are using optimal game strategy. John starts first always. You will be given the information about candys 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. In the next T lines, each line will contain two numbers a and b(0
Output
Output T lines, each of them containing information about the game winner. Print “John” if John will have to buy a new candy box or “Brother” in other case.
Sample Input
2
999 1000
1 2
Sample Output
John
Brother
Hint
T maybe as large as 1000000.