#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long gcd(long long x, long long y) {
  if (!y) return x;
  return gcd(y, x % y);
}
long long power(long long x, long long y) {
  long long res = 1ll;
  x %= MOD;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % MOD;
    y = y >> 1ll;
    x = (x * x) % MOD;
  }
  return res;
}
long long inv(long long x) {
  long long r = 1ll, t = x, k = MOD - 2ll;
  while (k) {
    if (k & 1ll) r = (long long)r * t % MOD;
    t = (long long)t * t % MOD;
    k >>= 1;
  }
  return r;
}
const int nax = 2e5 + 13;
void prep() {}
bool isPrime(long long x) {
  if (x == 1) return false;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) return false;
  }
  return true;
}
void solve() {}
void read() {
  int n, a, j, z;
  cin >> n;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    cin >> a;
    v.push_back(a);
  }
  for (int i = 30; i >= 0; i--) {
    j = 0;
    z = 0;
    for (auto el : v) {
      if (el & (1 << i)) {
        j++;
      } else {
        z++;
      }
    }
    if (j % 2 == 0) {
      continue;
    } else {
      if (j % 4 == 3 && z % 2 == 0) {
        cout << "LOSE" << endl;
        return;
      } else {
        cout << "WIN" << endl;
        return;
      }
    }
  }
  cout << "DRAW" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  cout.tie();
  int T = 1;
  prep();
  cin >> T;
  for (int i = 1; i <= T; i++) {
    read();
    solve();
  }
  return 0;
}
