CF1383B.GameGame

Koa the Koala and her best friend want to play a game.

The game starts with an array $a$ of length $n$ consisting of non-negative integers. Koa and her best friend move in turns and each have initially a score equal to $0$. Koa starts.

Let's describe a move in the game:

• During his move, a player chooses any element of the array and removes it from this array, xor-ing it with the current score of the player.

  More formally: if the current score of the player is $x$ and the chosen element is $y$, his new score will be $x \oplus y$. Here $\oplus$ denotes bitwise XOR operation.

  Note that after a move element $y$ is removed from $a$.

• The game ends when the array is empty.

At the end of the game the winner is the player with the maximum score. If both players have the same score then it's a draw.

If both players play optimally find out whether Koa will win, lose or draw the game.

考拉Koa和她最好的朋友想玩一个游戏。

游戏开始时有一个长度为 $n$ 的数组 $a$，其中所有元素均为非负整数。Koa和她最好的朋友轮流进行操作，两人初始得分均为 $0$，Koa先手。

下面我们描述一次操作的规则：

• 在一名玩家的操作中，他需从数组中任选一个元素并将其移除，并将该元素与自己当前得分作异或运算。

  更准确地说：若该玩家当前得分为 $x$，所选元素为 $y$，则其新得分为 $x \oplus y$。此处 $\oplus$ 表示按位异或运算。

  注意：操作完成后，元素 $y$ 将从数组 $a$ 中被移除。

• 当数组为空时，游戏结束。

游戏结束后，得分更高的玩家获胜；若双方得分相同，则为平局。

假设双方均以最优策略进行游戏，请判断Koa最终会获胜、失败还是平局。

Each test contains multiple test cases. The first line contains $t$ ($1 \le t \le 10^4$) — the number of test cases. Description of the test cases follows.

The first line of each test case contains the integer $n$ ($1 \le n \le 10^5$) — the length of $a$.

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($0 \le a_i \le 10^9$) — elements of $a$.

It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.

每个测试包含多个测试用例。第一行包含 $t$（$1 \le t \le 10^4$）—— 测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含整数 $n$（$1 \le n \le 10^5$）—— 数组 $a$ 的长度。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$0 \le a_i \le 10^9$）—— 数组 $a$ 的元素。

保证所有测试用例的 $n$ 之和不超过 $10^5$。

For each test case print:

• WIN if Koa will win the game.
• LOSE if Koa will lose the game.
• DRAW if the game ends in a draw.

对于每个测试用例，输出：

• 若 Koa 将赢得游戏，输出 WIN；
• 若 Koa 将输掉游戏，输出 LOSE；
• 若游戏以平局结束，输出 DRAW。

In testcase $1$ of the first sample we have:

$a = [1, 2, 2]$. Here Koa chooses $1$, other player has to choose $2$, Koa chooses another $2$. Score for Koa is $1 \oplus 2 = 3$ and score for other player is $2$ so Koa wins.

在第一个样例的测试用例 $1$ 中，我们有：

$a = [1, 2, 2]$。此处 Koa 选择 $1$，另一名玩家必须选择 $2$，Koa 再选择另一个 $2$。Koa 的得分为 $1 \oplus 2 = 3$，另一名玩家的得分为 $2$，因此 Koa 获胜。