#include <bits/stdc++.h>
using namespace std;
long long mod1 = 998244353;
long long mod = 1e9 + 7;
long long mod2 = 1e17 + 3;
const long long N = 3e5 + 12;
const long long M = 1e3 + 12;
long long n, a[N];
long long dp[40];
void solve() {
  memset(dp, 0, sizeof(dp));
  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) dp[j]++;
  }
  for (int i = 29; i >= 0; i--) {
    if (dp[i] == 0) continue;
    if (dp[i] % 2 == 0) continue;
    if (dp[i] == 1) {
      cout << "WIN";
      return;
    }
    int x = dp[i] / 2;
    if (x % 2) {
      if (n % 2) {
        cout << "LOSE";
        return;
      }
      cout << "WIN";
      return;
    } else {
      cout << "WIN";
      return;
    }
  }
  cout << "DRAW";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
    cout << "\n";
  }
  return 0;
}
