#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define ll long long
#define in(a) a=read()
#define out(a) printf("%d\n",a)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define clr(a,x) memset(a,x,sizeof(a))
inline ll read(){
    char c=getchar();ll f=1,x=0;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9')x=x*10+(c-'0'),c=getchar();
    return x*f;
}
#define mod 1000000007
void MOD(int &x){x-=x>=mod?mod:0;}
#define maxn 110
#define inf (1<<30)

int b[maxn][maxn],u[maxn];
int n,pos;
int flag,num;
void dfs(int x){
    if(x==pos&&num!=n){flag=1;return ;}
    else if(num<=2){flag=2;return ;}
    FOR(i,1,n){
        if(u[b[x][i]])continue;
        u[b[x][i]]=1;num--;
        dfs(b[x][i]);
        break;
    }
}
int main(){
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    int t;
    in(t);
    while(t--){
        in(n);
        FOR(i,1,n)if(read())pos=i;
        FOR(i,1,n)u[i]=0;
        FOR(i,1,n)
            FOR(j,1,n)
                in(b[i][j]); 
        flag=0;num=n;
        dfs(pos);
        if(flag==1)puts("lieren");
        else puts("langren");
    }
}