Ultron has set up an array of missiles to blow Earth up , with some missiles missing in between them . The Avengers challenge him to a game to protect earth . In the game , both the Avengers and Ultron take turns and can blow up either one or two adjacent missiles at a time . The one who blows up the last missile , wins the war . Assuming that the first turn is taken by the Avengers and that both are equally intelligent and play optimally , you need to tell us whether the Avengers can save Earth or not ? The array of missiles will be given as an array of 1's and 0's where 1 means the presence of a missile and 0 means that there is no missile present . Any of the two parties can blow up either 1 missile or two adjacent missiles only.
Input
The first line will contain an integer T which represents the number of test cases. Then T test cases follows. For each test case, the first line contains an integer N, which represents the number of missiles before the start of the game. And the second line contains a string of letters, where each letter is either 1 or 0.
Output
For each test case, print WIN if you can win this game, otherwise print LOSE.
Constraints
1 <= T <= 1000
1 <= N <= 300
There will be atleast one "1" in the array.