#include<bits/stdc++.h>

#define FOO(x,y) for(int x=0,x##_=(int)y;x<x##_;x++)
#define FOG(x,y,z) for(register int x=y,x##_=z;x<=x##_;++x)
#define DOG(x,y,z) for(register int x=y,x##_=z;x>=x##_;--x)
#define FOR(x,y,z) for(int x=y,x##_=z;x<=x##_;++x)
#define DOR(x,y,z) for(int x=y,x##_=z;x>=x##_;--x)
#define FOR_(x,y,z,s) for(int x=y,x##_=z;x<=x##_;x+=s)
#define DOR_(x,y,z,s) for(int x=y,x##_=z;x>=x##_;x-=s)
#define FOR__(x,y,z) for(int x=y,x##_=z;x<=x##_;x<<=1)
#define EOR(x,y) for(int x##_=head[x],y=edge[x##_].e;x##_;y=edge[x##_=edge[x##_].to].e)
#define EGOR(x,y,z) for(int x##_=head[x],y=edge[x##_].e,z=edge[x##_].c;x##_;y=edge[x##_=edge[x##_].to].e,z=edge[x##_].c)
#define EOD(x,y) for(int x##_=head[x],y=edge[x##_].e;x##_;y=edge[x##_=edge[x##_].to].e)
#define SOR(x,y) for(int x=y,x##_=y;x;x=x##_&(x-1))
#define SOO(x,y) for(int x=y,x##_=y;;x=x##_&(x-1))
#define FOB(b,y) for(int b##_=y,b=bin[b##_&-b##_];b##_;b##_&=b##_-1,b=bin[b##_&-b##_])
#define While(x) for(;x;)
#define clr(x,y) memset(x,y,sizeof(x))
#define lbd(A,s,e,x) (lower_bound(A+s,A+e+1,x)-A)
#define ubd(A,s,e,x) (upper_bound(A+s,A+e+1,x)-A)
#define uni(A,x) {sort(A+1,A+x+1);x=unique(A+1,A+x+1)-A-1;}
#define uniz(A,x) {sort(A,A+x);x=unique(A,A+x)-A;}
#define sot(A,s,e) sort(A+s,A+e+1)
#define szf(x) sizeof(x)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)

#define read2(x,y) read(x),read(y)
#define read3(x,y,z) read(x),read(y),read(z)
#define read4(x,y,z,w) read3(x,y,z),read(w)
#define reads(str) sf("%s",str)
#define readf(x) sf("%lf",&x)

#define ts (*this)
#define sf scanf
#define pf printf

#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define db double
#define ct clock_t
#define ck() clock()
#define rd rand()
#define rmx RAND_MAX
#define RD T*(rd*2-rmx)


using namespace std;

template<class T>bool tomin(T &x,T y){return y<x?x=y,1:0;}
template<class T>bool tomax(T &x,T y){return x<y?x=y,1:0;}
template<class T>void read(T &x){
    char c;
    x=0;
    int f=1;
    while(c=getchar(),c<'0'||c>'9')if(c=='-')f=-1;
    do x=(x<<3)+(x<<1)+(c^48);
    while(c=getchar(),c>='0'&&c<='9');
    x*=f;
}
bool mem1;
const db Pi=acos(-1);
const int maxn=55;
int n;
int K[maxn][maxn];
bool mark[maxn];
bool mem2;
int main(){
    // cerr<<(&mem2-&mem1)/1024.0/1024<<endl;
    srand(time(NULL));
    int T,s,e,x;
    read(T);
    while(T--){
        read(n);
        FOR(i,1,n)mark[i]=0;
        FOR(i,1,n){
            read(x);
            if(x)s=e=i;
        }
        FOR(i,1,n)FOR(j,1,n)read(K[i][j]);
        FOR(i,1,n-2)FOR(j,1,n)if(!mark[K[s][j]]){
            mark[K[s][j]]=1;
            s=K[s][j];
            break;
        }
        if(!mark[e])puts("langren");
        else puts("lieren");
    }
    return 0;
}