#include<bits/stdc++.h>
using namespace std;
const int M=55;
int tes,n,a[M][M],s,f[M],now;
void solve(){
    scanf("%d",&n);
    for(int i=1,x;i<=n;i++){
        scanf("%d",&x);
        if(x)s=i;
    }
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
        scanf("%d",&a[i][j]);
    for(int i=1;i<=n;i++)f[i]=0;
    now=s;
    for(int i=n-1;i>=0;i--){
        int tg=-1;
        for(int j=1;j<=n;j++)if(!f[a[now][j]]){tg=a[now][j];break;}
        f[tg]=1;
        if(tg==s){puts("lieren");return;}
        if(i<=2){puts("langren");return;}
        now=tg;
    }
}
int main(){
    scanf("%d",&tes);
    while(tes--)solve();
    return 0;
}