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. \InputFile The first line of input will contain a single integer \textbf{T} -- the number of test cases. Next \textbf{T} pairs of lines will describe tests in a following format. The first line of each test will contain an integer \textbf{N} -- the amount of different M&M colors in a box. Next line will contain \textbf{N} integers \textbf{Ai}, separated by spaces -- amount of M&Ms of \textbf{i}-th color. Constraints: \textbf{1} <= \textbf{T} <= \textbf{474}, \textbf{1} <= \textbf{N} <= \textbf{47}, \textbf{1} <= \textbf{Ai} <= \textbf{4747} \OutputFile Output \textbf{T} lines each of them containing information about game winner. Print "\textbf{John}" if John will win the game or "\textbf{Brother}" in other case.