#include <bits/stdc++.h>
const int N = 1000005;
using namespace std;
long long n, k, sum, q, res, m, val, ans;
long long x, y;
double p;
long long xx[] = {1, 0, -1, 0};
long long yy[] = {0, 1, 0, -1};
void solve(long long no) {
  cin >> n;
  long long res = 0;
  vector<long long> v[64];
  for (int i = 0; i < n; i++) {
    cin >> x;
    res ^= x;
    for (int j = 0; j < 64; j++)
      if (x & (1LL << j)) v[j].push_back(i);
  }
  if (res == 0) {
    cout << "DRAW\n";
    return;
  }
  vector<long long> v1;
  for (int j = 63; j >= 0; j--) {
    if (v[j].size() % 4 == 1) {
      cout << "WIN\n";
      return;
    } else if (v[j].size() % 4 == 3) {
      if ((n - v[j].size()) % 2)
        cout << "WIN\n";
      else
        cout << "LOSE\n";
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  for (long long i = 1; i <= t; i++) solve(i);
}
