from functools import reduce
def zeroMoveNim(p):
    p=[i-1+2*(i%2) for i in p]
    return 'W' if reduce((lambda x,y:x^y),p) else 'L'

for t in range(int(input())):
    input()
    y = 0
    for z in input().split():
        x = int(z)
        if x%2:
            x+=1
        else:
            x-=1
        y^=x
    if y:
        print ("W")
    else:
        print ("L")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

void solve(){
  int n;
  scanf("%d",&n);
  int x = 0;
  while(n--){
    int v;
    scanf("%d",&v);
    if(v&1)v++;
    else v--;
    x ^= v;
  }
  puts(x==0?"L":"W");
}

int main(){
  int g;
  scanf("%d",&g);
  while(g--)solve();
  return 0;
}