#include <bits/stdc++.h>
template <class T>
int sz(T x) {
  return (int)x.size();
};
using ll = long long;
using std::array;
using std::cin;
using std::cout;
using std::map;
using std::max;
using std::min;
using std::set;
using std::sort;
using std::string;
using std::vector;
void solve() {
  int n;
  scanf("%d", &n);
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  vector<int> bit(32, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 32; j++) {
      if (a[i] & 1LL << j) {
        bit[j]++;
      }
    }
  }
  int XOR = 0;
  for (int i = 0; i < n; i++) {
    XOR ^= a[i];
  }
  if (XOR == 0) {
    printf("DRAW\n");
    return;
  }
  for (int BIT = 31; BIT >= 0; BIT--) {
    int count = bit[BIT];
    if (!(count & 1)) {
      continue;
    }
    assert(count & 1);
    int odd = count, even = n - count;
    assert(odd + even == n);
    if (odd % 4 == 3 && !(even & 1)) {
      printf("LOSE\n");
    } else {
      printf("WIN\n");
    }
    return;
  }
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}
