#include <bits/stdc++.h>
template <typename T>
bool chmax(T &m, const T q) {
  if (m < q) {
    m = q;
    return true;
  } else
    return false;
}
template <typename T>
bool chmin(T &m, const T q) {
  if (m > q) {
    m = q;
    return true;
  } else
    return false;
}
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
const long long MOD = 1000000007;
long long power(int a, int b) {
  long long result = 1;
  while (b > 0) {
    if (b & 1) result *= a;
    a *= a;
    b /= 2;
  }
  return result;
}
vector<vector<long long>> matMultiply(vector<vector<long long>> a,
                                      vector<vector<long long>> b) {
  int N = a.size();
  vector<vector<long long>> product(N, vector<long long>(N, 0));
  for (int i = int(0); i < int(N); ++i)
    for (int j = int(0); j < int(N); ++j)
      for (int k = int(0); k < int(N); ++k)
        product[i][k] = (product[i][k] + (a[i][j] * b[j][k]) % MOD) % MOD;
  return product;
}
vector<vector<long long>> matExpo(vector<vector<long long>> a, long long pow) {
  int N = a.size();
  vector<vector<long long>> ans(N, vector<long long>(N, 0));
  for (int i = int(0); i < int(N); ++i)
    for (int j = int(0); j < int(N); ++j)
      if (i == j) ans[i][j] = 1;
  while (pow > 0) {
    if (pow & 1) {
      ans = matMultiply(ans, a);
    }
    pow /= 2;
    a = matMultiply(a, a);
  }
  return ans;
}
long long inverse(int a, int p) { return power(a, p - 2); }
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (int i = int(0); i < int(n); ++i) cin >> a[i];
  long long count[30] = {};
  for (int i = int(0); i < int(n); ++i) {
    for (int j = int(0); j < int(30); ++j) {
      if (a[i] & (1 << j)) {
        count[j]++;
      }
    }
  }
  for (int i = int(29); i > int(-1); i--) {
    if (count[i] & 1 && count[i] % 4 == 1) {
      cout << "WIN" << '\n';
      return;
    }
    if (count[i] & 1 && count[i] % 4 == 3 && (n - count[i]) % 2 == 1) {
      cout << "WIN" << '\n';
      return;
    }
    if (count[i] & 1) {
      cout << "LOSE" << '\n';
      return;
    }
  }
  cout << "DRAW" << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
