#include <bits/stdc++.h>
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const long long linf = (long long)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n;
int a[N];
void solve() {
  cin >> n;
  for (int i = (1); i <= (n); i++) {
    cin >> a[i];
  }
  for (int i = (30); i >= (0); i--) {
    int x = 0, y = 0;
    for (int j = (1); j <= (n); j++) {
      if (a[j] & (1 << i))
        x++;
      else
        y++;
      ;
    }
    if (x % 2 == 0) continue;
    if ((x / 2) % 2 == 0) {
      cout << "WIN" << '\n';
      return;
    }
    if (y & 1) {
      cout << "WIN" << '\n';
    } else {
      cout << "LOSE" << '\n';
    }
    return;
    ;
  }
  cout << "DRAW" << '\n';
}
int main() {
  ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) solve();
  exit(0);
}
