#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const double PI = 4 * atan(1);
long long int pow(long long int b, long long int p) {
  return !p ? 1
            : pow(b * b % (long long int)(99998244353), p / 2) *
                  (p & 1 ? b : 1) % (long long int)(99998244353);
}
long long int inv(long long int b) {
  return pow(b, (long long int)(99998244353) - 2);
}
void solve() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  long long int k = pow(2, 30);
  long long int flag = 0;
  for (long long int ii = 30; ii >= 0; ii--) {
    long long int x = 0, y = 0;
    for (long long int i = 0; i < n; i++) {
      if (k & a[i]) x++;
    }
    if (x % 2 != 0) {
      y = n - x;
      flag = 1;
      if (x % 4 == 3 and y % 2 == 0) {
        cout << "LOSE" << endl;
        break;
      } else {
        cout << "WIN" << endl;
        break;
      }
    }
    k /= 2;
  }
  if (flag == 0) cout << "DRAW" << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  cin >> t;
  for (long long int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
