Problem Statement

There are $N$ cookies on a desk. Each cookie has a positive integer on its surface: $A_1, A_2, \dots, A_N$, which are all different.

Let us play a game with two players using these cookies. In this game, the players alternately do the following action.

Choose a cookie on the desk and eat it. Then, if the $\mathrm{XOR}$ of the integers written on the remaining cookies on the desk becomes $0$, the player wins, and the game ends.

You have asked the boy E869120 to play this game with you. You go first, and E869120 goes second. Are you going to win if both players play optimally?

What is $\mathrm{XOR}$? The bitwise $\mathrm{XOR}$ of integers $A$ and $B$, $A\ \mathrm{XOR}\ B$, is defined as follows: When $A\ \mathrm{XOR}\ B$ is written in base two, the digit in the $2^k$'s place ($k \geq 0$) is $1$ if exactly one of $A$ and $B$ is $1$, and $0$ otherwise. For example, we have $3\ \mathrm{XOR}\ 5 = 6$ (in base two: $011\ \mathrm{XOR}\ 101 = 110$). Generally, the bitwise $\mathrm{XOR}$ of $k$ integers $p_1, p_2, p_3, \dots, p_k$ is defined as $(\dots ((p_1\ \mathrm{XOR}\ p_2)\ \mathrm{XOR}\ p_3)\ \mathrm{XOR}\ \dots\ \mathrm{XOR}\ p_k)$. We can prove that this value does not depend on the order of $p_1, p_2, p_3, \dots p_k$. Particularly, when $k = 0$, the $\mathrm{XOR}$ is $0$.

Constraints

• $1 \leq N \leq 400000$
• $1 \leq A_i \leq 10^9 \ (1 \leq i \leq N)$
• $A_1, A_2, \dots, A_N$ are all different.
• The $\mathrm{XOR}$ of $A_1, A_2, \dots, A_N$ is not $0$.
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \cdots A_N

Output

If you are going to win if both players play optimally, print Win; if you are going to lose, print Lose.