#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define _for(i,a,b) for(register int (i)=(a);(i)<=(b);(i)++)
#define For(i,a,b) for(register int (i)=(a);(i)>=(b);(i)--)
#define INF 0x7fffffff
#define il inline
#define rg register
const int N=55;
int T;
int n;
bool check[N];
int li[N][N];
int mem,tot;
il int init(rg int o){
    ++tot;
    check[o]=true;
    _for(i,1,n) if(!check[li[o][i]]) return li[o][i]; 
}
il void solve(){
    memset(check,false,sizeof(check));
    scanf("%d",&n);
    _for(i,1,n){
        int op; scanf("%d",&op);
        if(op) mem=i;
    }
    tot=0;
    _for(i,1,n) _for(j,1,n) scanf("%d",&li[i][j]);
    int st=init(li[mem][1]);
    while(tot<n-2 and !check[mem]){
        if(st==mem) return puts("lieren"),void();
        st=init(st);
        // if(st==mem) return puts("lieren"),void();
    }
    // printf("%d\n",mem);
    puts(check[mem] ? "lieren" : "langren");
}
int main(){
    scanf("%d",&T);
    while(T--) solve();
    return 0;
}