#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e5 + 5;
int dp[2][MAXN][2][2];
int cnt[30];
int n;
bool bit(int x, int p) { return x & (1 << p); }
void pre() {
  for (int i = 0; i < 2; ++i) {
    for (int j = 0; j < MAXN; ++j) {
      for (int a = 0; a < 2; ++a) {
        for (int b = 0; b < 2; ++b) {
          dp[i][j][a][b] = -1;
        }
      }
    }
  }
}
int rec(int zero, int one, int a, int b) {
  if (zero == 0 && one == 0) {
    assert(a != b);
    return (a == 1 && b == 0);
  }
  int &ret = dp[zero][one][a][b];
  if (ret != -1) {
    return ret;
  }
  ret = 0;
  if (zero > 0) {
    ret |= (1 - rec(zero - 1, one, b, a));
  }
  if (one > 0) {
    ret |= (1 - rec(zero, one - 1, b, 1 - a));
  }
  return ret;
}
void solve() {
  scanf("%d", &n);
  fill(cnt, cnt + 30, 0);
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    for (int j = 0; j < 30; ++j) {
      cnt[j] += bit(x, j);
    }
  }
  int p = 29;
  while (~p && cnt[p] % 2 == 0) {
    --p;
  }
  if (p == -1) {
    printf("DRAW\n");
    return;
  }
  int zero = n - cnt[p];
  int one = cnt[p];
  zero %= 2;
  int ans = rec(zero, one, 0, 0);
  printf(ans ? "WIN\n" : "LOSE\n");
}
int main() {
  int tt;
  scanf("%d", &tt);
  pre();
  while (tt--) {
    solve();
  }
  return 0;
}
