1. In each turn, each player will choose exactly one in n of durians as mentioned above and eat it. However, to make the competition more exciting, its weight must be strictly greater than any others eaten in previous turns. If there are not any durians that satisfy the condition, the player would lose and the competition should stop.

2. Wong and Strange will attend in this game. They move in turns and Wong will play first.

The first line of the input contains an integer t (1 ≤ t ≤ 10), the number of test cases. Each test case is given in two continuous lines. The first line of test case consists of a non-negative integer n (|n| ≤ 100), the number of multiverse-collected durians. The second one has n positive integers a₁, a₂, . . . , a_n (|a_i| ≤ 21520029), in kilos, the weight of these durians.

For each test case, print a single string in a single line, which is the name of the winner if both players play optimally.

• In the first turn, Wong could choose the 616 kilos durian and eat it.

• In the second turn, the 838 kilos is selected by Strange.

• In the third turn, the last one satisfies the condition so Wong will get it.

• There are not any durians left for Strange to choose, so he is going to lose the game.