Help Dr. Wu

Dr. Wu is going to organize a competition. He has decided to judge the participants using an automated system. He himself has programmed the system.

It is an individual competition. Each participant will be given a number $N$. After that, the participant will have to tell $N$ unique numbers and the system is supposed to save these numbers sequentially. If a contestant responds with $N$ unique numbers, the contestant will win. If a participant mistakenly mentions a number more than once, the participant will lose. The system was supposed to be programmed in such a way that, from the inputs of each contestant, it will calculate if a participant wins or loses.

But there is a problem with the automated system. It is supposed to save an array of $N$ numbers described by each participant. But instead, it is saving another set of $N$ numbers. For any index $i$, instead of saving the $i-th$ number inserted by a participant, it is actually saving the sum of the numbers from the first to the $i-th$ position mentioned by the participant. The contest is not very far away. It is impossible to reset the system. Thus, Dr. Wu has decided that he will determine the results of the participants using the existing system. Help him to determine the results of each of the participants.

Input

The first line of the input will contain an integer $T$ ($1≤T≤100$) that denotes the number of test cases.

Then for each test case, there will be one line with a positive integer $N$ ( $1≤N≤100000$) that denotes the number that will be given to a participant. Then on the next line there will be $N$ integers, each integer $A_i$ ( $-10^{18} \leq A_i \leq 10^{18}$) denotes the sum from index $1$ to index $i$ of the original array created by Wu’s system from the participants’ response.

The size of the input file will not exceed 20 MB.

Output

For each test case, if the participant mentions $N$ unique numbers, print $Won$, and if the participant fails to mention $N$ unique numbers, then print $Lost$.

Sample

1
5
8 9 14 27 29

Won