Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

BALLSREM - Remove the Balls

There are n boxes with mi balls in box i. Two players by turns must take away from a single box an arbitrary number of balls but at least one. You as one of the players start removing balls. If you take the last ball you lose.

Input

In the first line the number T of test cases (T<=100).
Then T lines with n (3<=n<=21) numbers mi (0<mi<100).

Output

For each test case win if you could win the game otherwise lose.

Example

Input:
3
1 1 1
1 1 2
1 1 1 1 Output: lose
win
win

Added by:HWK
Date:2011-05-21
Time limit:6.533s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: SCM qobi

hide comments
2011-05-29 07:32:22 Jander
I'll have a look later :-)
2011-05-24 21:26:26 HWK
@hallvabo: No, I can't! :-(
It seems that you're the Python-master. :-)
2011-05-24 14:35:37 Hallvard Norheim Bø
@HWK: can you do better than 83 bytes of Python?
2011-05-24 11:34:08 HWK
@Jander: Show us that Perl can do it with less than 51 bytes. ;-)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.