#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 12, LG = 31;
int n, a[N];
int cnt[LG];
void solve();
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int TEST = 1;
  cin >> TEST;
  while (TEST--) solve();
  return 0;
}
void solve() {
  cin >> n;
  for (int i = 0; i < LG; i++) cnt[i] = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    for (int j = 0; j < LG; j++)
      if (a[i] & (1 << j)) cnt[j]++;
  }
  for (int i = LG - 1; i >= 0; i--) {
    if (cnt[i] % 2 == 0) continue;
    int n1 = cnt[i];
    int n2 = n - cnt[i];
    if (n1 % 4 == 1)
      cout << "WIN\n";
    else if (n2 % 2 == 1)
      cout << "WIN\n";
    else
      cout << "LOSE\n";
    return;
  }
  cout << "DRAW\n";
  return;
}
