#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1;
int n, m, vis[N], a[N], cnt[64];
void solve() {
  memset(cnt, 0, sizeof cnt);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    int t = a[i];
    for (int i = 0; t; i++, t >>= 1)
      if (t & 1) cnt[i]++;
  }
  for (int i = 32; i >= 0; i--) {
    if (cnt[i] % 2) {
      if ((cnt[i] - 1) / 2 % 2 && n % 2) {
        puts("LOSE");
        return;
      } else {
        puts("WIN");
        return;
      }
    }
  }
  puts("DRAW");
}
int main() {
  int _;
  cin >> _;
  while (_--) solve();
  return 0;
}
