#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const long long mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<long long> A(n);
  for (int i = (int)(0); i < (int)(n); i++) cin >> A[i];
  vector<int> cnt(40);
  for (int i = (int)(0); i < (int)(n); i++)
    for (int j = (int)(0); j < (int)(40); j++) cnt[j] += (A[i] >> j) & 1;
  for (int i = (int)(40 - 1); i >= (int)(0); i--) {
    if (cnt[i] % 2 == 0) continue;
    int tmp = cnt[i] / 2;
    if (n % 2)
      cout << (tmp % 2 ? "LOSE" : "WIN") << "\n";
    else
      cout << "WIN"
           << "\n";
    return;
  }
  cout << "DRAW"
       << "\n";
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int T;
  cin >> T;
  while (T--) solve();
  return 0;
}
