#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
inline string IntToString(long long a) {
  char x[100];
  sprintf(x, "%lld", a);
  string s = x;
  return s;
}
inline long long StringToInt(string a) {
  char x[100];
  long long res;
  strcpy(x, a.c_str());
  sscanf(x, "%lld", &res);
  return res;
}
inline string GetString(void) {
  char x[1000005];
  scanf("%s", x);
  string s = x;
  return s;
}
inline string uppercase(string s) {
  int n = (int)s.size();
  for (int(i) = (0); (i) < (n); ++(i))
    if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}
inline string lowercase(string s) {
  int n = (int)s.size();
  for (int(i) = (0); (i) < (n); ++(i))
    if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}
inline void OPEN(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
int f(int a, int b, int c) {
  if (a == 0) return c % 2;
  if (a == 1) return (c + b) % 2;
  if (b == 0) return c % 2;
  if (a > b) {
    int ret2 = 1;
    if (a - 2 >= b - 1) ret2 &= f(a - 2, b - 1, c);
    if (a - 2 >= b) ret2 &= f(a - 2, b, c);
    if (ret2) return 1;
  }
  {
    int ret2 = 1;
    if (a - 2 >= b - 1) ret2 &= f(a - 2, b - 1, c + 1);
    if (b > 1) ret2 &= f(a - 2, b - 2, c + 1);
    if (ret2) return 1;
  }
  return 0;
}
int t;
int n;
int ada[30];
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    memset(ada, 0, sizeof(ada));
    for (int(i) = (0); (i) < (n); ++(i)) {
      int x;
      scanf("%d", &x);
      for (int(i) = (0); (i) < (30); ++(i))
        if (x & (1 << i)) ++ada[i];
    }
    for (int(i) = (29); (i) >= (0); --(i)) {
      if (ada[i] % 2 == 1) {
        if (ada[i] % 4 == 3 && n % 2 == 1) {
          puts("LOSE");
        } else
          puts("WIN");
        goto hell;
      }
    }
    puts("DRAW");
  hell:;
  }
  return 0;
}
