import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;

string solve (int n, int [] a)
{
	foreach_reverse (b; 0..30)
	{
		auto z = a.count !(x => (x & (1 << b)) > 0);
		if (z & 1)
		{
			if (z % 2 == n % 2 && z % 4 == 3)
			{
				return "LOSE";
			}
			return "WIN";
		}
	}
	return "DRAW";
}

void main ()
{
	auto tests = readln.strip.to !(int);
	foreach (test; 0..tests)
	{
		auto n = readln.strip.to !(int);
		auto a = readln.splitter.map !(to !(int)).array;
		writeln (solve (n, a));
	}
}
