#include <bits/stdc++.h>
using namespace std;
const double pi = acos((double)(-1));
const int maxn = 100010;
const int mod = 1e9 + 7;
int moven1[10][5] = {{1, 0, 0},  {-1, 0, 0}, {0, 1, 0},
                     {0, -1, 0}, {0, 0, 1},  {0, 0, -1}};
int moven2[10][5] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int t, n, a[maxn], cnt;
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    cnt = 0;
    int flag = 0;
    for (int i = 30; i >= 0; i--) {
      cnt = 0;
      for (int j = 1; j <= n; j++) {
        if ((a[j] >> i) & 1) cnt++;
      }
      if (cnt % 2) {
        if (cnt % 4 == 1) {
          flag = 1;
        } else {
          if (n % 2)
            flag = -1;
          else
            flag = 1;
        }
        break;
      }
    }
    if (flag == 1) puts("WIN");
    if (flag == -1) puts("LOSE");
    if (flag == 0) puts("DRAW");
  }
  return 0;
}
