#include <bits/stdc++.h>
using namespace std;
class node {
 public:
  node *next;
  int d;
  node(int d) {
    this->d = d;
    this->next = NULL;
  }
};
void dfs(int i, int j, bool vis[][200], int d[], int p[], int l, int K) {
  if (vis[i][j]) {
    return;
  }
  if ((d[i] + p[j]) > l) {
    return;
  }
  vis[i][j] = true;
  dfs(i, (j + 1) % K, vis, d, p, l, K);
  dfs(i + 1, (j + 1) % K, vis, d, p, l, K);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t, n, d[100000], coun1[30];
  int ans;
  cin >> t;
  while (t-- > 0) {
    cin >> n;
    ans = 0;
    for (int i = 0; i < n; i++) cin >> d[i];
    for (int j = 0; j < 30; j++) {
      coun1[j] = 0;
    }
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < 30; j++) {
        if ((d[i] >> j & 1) == 1) coun1[j] += 1;
      }
    }
    for (int i = 29; i >= 0; i--) {
      if (coun1[i] % 2 == 1) {
        if (coun1[i] % 4 == 3 && (n - coun1[i]) % 2 == 0)
          ans = 2;
        else
          ans = 1;
        break;
      }
    }
    switch (ans) {
      case 0:
        cout << "DRAW" << endl;
        break;
      case 1:
        cout << "WIN" << endl;
        break;
      case 2:
        cout << "LOSE" << endl;
        break;
    }
  }
}
