#include <bits/stdc++.h>
long long q_pow(long long x, long long n, long long mod) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = x * ret % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return ret;
}
long long __gcd(long long x, long long y) {
  if (!y) return x;
  return __gcd(y, x % y);
}
long long getbit(long long now) {
  int cnt = 0;
  while (now) {
    cnt++;
    now -= (now) & (-now);
  }
  return cnt;
}
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
using namespace std;
const long long INF = 0x3f3f3f3f;
const int maxn = 1e6 + 60;
const int maxm = 200 * 200 + 10;
const double eps = 1e-7;
const double pi = acos(-1);
const int mod = 1e9 + 7;
int num[maxn];
int main(int argc, char *argv[]) {
  if (argc == 2 && strcmp("-debug", argv[1]) == 0) {
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
  }
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
    int now = 0;
    for (int i = 1; i <= n; i++) now ^= num[i];
    if (now == 0) {
      printf("DRAW\n");
      continue;
    }
    for (int i = 30; i >= 0; i--) {
      if ((now >> i) & 1) {
        int a = 0;
        for (int j = 1; j <= n; j++)
          if ((num[j] >> i) & 1) a++;
        if (a % 4 == 3 and n % 2 == 1)
          printf("LOSE\n");
        else
          printf("WIN\n");
        break;
      }
    }
  }
  return 0;
}
