#include<bits/stdc++.h>
#define N 55
typedef long long ll;
using namespace std;
bool f2;
char IO;
int rd(){
    int num=0;bool f=0;
    while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
    do num=(num<<1)+(num<<3)+(IO^48);
    while(IO=getchar(),IO>=48&&IO<=57);
    return f?-num:num;
}
int n;
bool DEAD[N];
int Table[N][N];
queue<int> Q[2];
bool f1;
int main(){
//    cout<<1.0*(&f1-&f2)/1024.0/1024.0<<endl;
    int T=rd();
    while(T--){
        memset(DEAD,0,sizeof(DEAD));
        n=rd();
        int WOLF=0;
        for(int i=1;i<=n;++i)
            if(rd()==1)WOLF=i;
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                Table[i][j]=rd();
        int rst=n;
        int K=1,i,X=WOLF;
        while(rst>2){
            for(int i=1;i<=n;++i){
                if(!DEAD[Table[X][i]]){
                    DEAD[Table[X][i]]=1;
                    X=Table[X][i];--rst;
                    break;
                }
            }
            if(DEAD[WOLF])break;
        }
        if(DEAD[WOLF])puts("lieren");
        else puts("langren");
    }
    return 0;
}