B. Stoned Game

链接：https://codeforces.com/problemset/problem/1396/B

T is playing a game with his friend, HL.

There are nn piles of stones, the ii-th pile initially has aiai stones.

T and HL will take alternating turns, with T going first. In each turn, a player chooses a non-empty pile and then removes a single stone from it. However, one cannot choose a pile that has been chosen in the previous turn (the pile that was chosen by the other player, or if the current turn is the first turn then the player can choose any non-empty pile). The player who cannot choose a pile in his turn loses, and the game ends.

Assuming both players play optimally, given the starting configuration of tt games, determine the winner of each game.

Input

The first line of the input contains a single integer tt (1≤t≤100)(1≤t≤100) — the number of games. The description of the games follows. Each