#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=5000+5;
const ll INF=0x3f3f3f3f3f3f3f3fll;
int t,n;
int main() {
ios::sync_with_stdio(false);
//freopen("校庆的娱乐.in","r",stdin);
cin>>t;
while(t--){
cin>>n;
int temp,x;
cin>>temp;
for(int i=2;i<=n;i++){
cin>>x;
temp^=x;
}
if(temp||n&1) cout<<"lolanv"<<endl;
else cout<<"Wind"<<endl; //只有全是对子 才会让wind赢
}

return 0;
}