#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 5, B = 32;
int n, a[MX];
int nb[B];
void solve() {
  cin >> n;
  for (int i = (0); i < (n); ++i) cin >> a[i];
  memset((nb), 0, (B) * sizeof((nb)[0]));
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (B); ++j) nb[j] += (a[i] >> j) & 1;
  int b = B - 1;
  while (b >= 0 && (nb[b] & 1) ^ 1) --b;
  if (b == -1)
    cout << "DRAW\n";
  else
    cout << ((nb[b] & 2 && n & 1) ? "LOSE" : "WIN") << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
