#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
int T,n,r[99999],w;
int g[2005][2005];
void sol() {
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
        scanf("%d",r+i),r[i]?(w=i):0;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            scanf("%d",&g[i][j]);
    int q=g[w][1];
    for(int l=n-1;;--l) {
        if(r[q]) {
            puts("lieren");
            return;
        }
        r[q]=-1;
        if(l<=2) {
            puts("langren");
            return;
        }
        for(int u=1;u<=n;++u) {
            if(r[g[q][u]]!=-1) {
                q=g[q][u];
                break;
            }
        }
    }
    assert(0);
}
int main()
{
    scanf("%d",&T);
    while(T--) sol();
}