atcoder#ARC131C. [ARC131C] Zero XOR

[ARC131C] Zero XOR

Score : 600600 points

Problem Statement

There are NN cookies on a desk. Each cookie has a positive integer on its surface: A1,A2,,ANA_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 XOR\mathrm{XOR} of the integers written on the remaining cookies on the desk becomes 00, 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

  • 1N4000001 \leq N \leq 400000
  • 1Ai109 (1iN)1 \leq A_i \leq 10^9 \ (1 \leq i \leq N)
  • A1,A2,,ANA_1, A_2, \dots, A_N are all different.
  • The XOR\mathrm{XOR} of A1,A2,,ANA_1, A_2, \dots, A_N is not 00.
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN

A1A_1 A2A_2 \cdots ANA_N

Output

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

6
9 14 11 3 5 8
Lose

In this case, regardless of what choices you make, you will lose if E869120 keeps playing optimally.

For example, let us say you first eat the cookie with 1111 written on it. Then, E869120 will eat the cookie with 99 so that the XOR\mathrm{XOR} of the numbers written on the remaining cookies, 14,3,5,814, 3, 5, 8, is 00, making him win.

Even if you make other choices, E869120 will win eventually.

1
131
Win

In this case, your only choice in your first turn is to eat the cookie with 131131. Then, there is no more cookie on the desk, making the XOR\mathrm{XOR} of the numbers written on the remaining cookies 00. Therefore, before E869120 gets to do anything, you win.

8
12 23 34 45 56 78 89 98
Win