#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n;
long long a[N], cnt[30];
void sol() {
  memset(cnt, 0, sizeof cnt);
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    for (long long j = 0; j < 30; j++) {
      if (a[i] >> j & 1) cnt[j]++;
    }
  }
  long long bit = -1;
  for (long long i = 29; i >= 0; i--) {
    if (cnt[i] % 2) {
      bit = i;
      break;
    }
  }
  if (bit == -1) {
    cout << "DRAW"
         << "\n";
  } else {
    long long x = cnt[bit];
    long long y = n - x;
    if (x % 4 == 3 && y % 2 == 0)
      cout << "LOSE"
           << "\n";
    else
      cout << "WIN"
           << "\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t;
  cin >> t;
  while (t--) {
    sol();
  }
  return 0;
}
