#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int K = 31;
const int INF = 0x3f3f3f3f;
const long long INF_LL = 0x3f3f3f3f3f3f3f3f;
int cnt[K];
int Solve() {
  memset(cnt, 0, sizeof(cnt));
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    for (int j = 0; j < K; j++)
      if ((x >> j) & 1) cnt[j]++;
  }
  for (int i = K - 1; i >= 0; i--) {
    if (cnt[i] % 2 == 0) continue;
    if (cnt[i] % 4 == 3 && (n - cnt[i]) % 2 == 0)
      return -1;
    else
      return 1;
  }
  return 0;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int f = Solve();
    if (f == 1)
      printf("WIN\n");
    else if (f == -1)
      printf("LOSE\n");
    else
      printf("DRAW\n");
  }
  return 0;
}
