#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const vector<int> mods = {998244353, 1000000007, 1000000009};
const long long inf = 3e18;
const double pi = acos(-1.0);
const double eps = 0.0000001;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class... K>
using umap = unordered_map<K...>;
template <class... K>
using uset = unordered_set<K...>;
long long t, n, b[100];
vector<long long> a;
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout.precision(12);
  cin >> t;
  for (long long _t = (0); _t < (t); ++_t) {
    cin >> n;
    a.assign(n, 0);
    fill(&b[0], &b[0] + sizeof(b) / sizeof(b[0]), 0);
    for (long long i = (0); i < (n); ++i) {
      cin >> a[i];
      for (long long j = (0); j < (62); ++j) {
        if ((1 << j) > a[i]) {
          break;
        }
        if ((1 << j) & a[i]) b[j]++;
      }
    }
    long long m = -1;
    for (long long j = 80; j >= 0; j--) {
      if (b[j] % 2 == 0)
        continue;
      else {
        m = j;
        break;
      }
    }
    if (m == -1)
      cout << "DRAW\n";
    else if ((b[m] - 1) % 4 == 0)
      cout << "WIN\n";
    else if ((n - b[m]) & 1)
      cout << "WIN\n";
    else
      cout << "LOSE\n";
  }
  return 0;
}
