#include<bits/stdc++.h>
using namespace std;

#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a,b) for(int i=hd[a];i;i=nxt[i])

typedef long long ll;
void Max(int &x,int y){x<y&&(x=y);}
void Min(int &x,int y){x>y&&(x=y);}

bool vio;
char IO;
int rd(int res=0){
    bool f=0;
    while(IO=getchar(),IO<48||IO>57)
        f|=IO=='-';
    do res=(res<<1)+(res<<3)+(IO^48);
    while(IO=getchar(),isdigit(IO));
    return f?-res:res;
}
const int M=105;
int rk[M][M],op[M],que[M];
bool lv[M];
bool let;
int main(){
    //cerr<<(&vio-&let)/1024.0/1024<<endl;
    rep(cas,1,rd()){
        int n=rd(),lr;
        rep(i,1,n){
            op[i]=rd();
            if(op[i]==1)lr=i;
        }
        rep(i,1,n)rep(j,1,n)rk[i][j]=rd();
        rep(i,1,n)lv[i]=1;
        int L=1,R=0;
        que[++R]=rk[lr][1];
        while(L<=R){
            int x=que[L++];
            lv[x]=0;
            if(x==lr){
                puts("lieren");
                break;
            }
            if(L>=n-1){
                puts("langren");
                break;
            }
            rep(i,1,n)if(lv[rk[x][i]]){
                que[++R]=rk[x][i];
                break;
            }
        }
    }    
}