#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1e9 + 7;
const int Maxn = 1e5 + 10;
int a[Maxn];
int vis[105];
int sum[105];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    memset(vis, 0, sizeof(vis));
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j < 32; j++) {
        if (a[i] >> j & 1) vis[j]++;
      }
    }
    int Max = -1;
    for (int i = 0; i < 32; i++) {
      if (vis[i] % 2 == 1) Max = i;
    }
    if (Max == -1) {
      printf("DRAW\n");
      continue;
    } else {
      if ((vis[Max] - 1) / 2 % 2 == 0) {
        printf("WIN\n");
      } else if ((vis[Max] - 1) / 2 % 2 == 1 && n % 2 == 1) {
        printf("LOSE\n");
      } else
        printf("WIN\n");
    }
  }
}
