#include <bits/stdc++.h>   using namespace std;   int n;   int a[210000];   void work() {     int cnt[33];     memset((cnt), (0), sizeof(cnt));     int xorsum = 0;     cin >> n;     for (int i = 0; i < n; i++) {       scanf( %d , &a[i]);       xorsum ^= a[i];       for (int j = 0; j <= 30; j++) cnt[j] += (a[i] >> j) & 1;     }     for (int i = 30; i >= 0; i--) {       if ((xorsum >> i) & 1) {         if ((cnt[i] - 1) % 4 == 0) {           printf( WIN n );           return;         } else {           if (n & 1) {             printf( LOSE n );             return;           } else {             printf( WIN n );             return;           }         }       }     }     printf( DRAW n );   }   int main() {     int t;     cin >> t;     while (t--) {       work();     }     return ~~(0 ^ 0 ^ 0);   }   