#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const long long mod = 1e9 + 7;
const int mxN = 1e5 + 9;
void solve() {
  int n, tmp;
  cin >> n;
  vector<int> bits(35, 0);
  for (int i = 1; i <= n; i++) {
    cin >> tmp;
    for (int i = 0; i <= 31; i++) {
      int x = (tmp >> i) & 1;
      bits[i] += x;
    }
  }
  bool ok = false;
  int number_one, number_zero;
  for (int i = 31; i >= 0; --i) {
    number_one = bits[i];
    number_zero = n - number_one;
    if (number_one % 2 != 0) {
      ok = true;
      break;
    }
  }
  if (!ok) {
    cout << "DRAW\n";
    return;
  }
  if (((number_one) % 4) == 1) {
    cout << "WIN\n";
    return;
  } else if (((number_one) % 4) == 3) {
    if (number_zero % 2 == 1) {
      cout << "WIN\n";
      return;
    } else {
      cout << "LOSE\n";
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
