#include<bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,true:false;}

int readint(){
    int x=0,f=1; char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

const int cys=998244353;
int n,num;
int a[55];
bool vis[55];
int p[55][55];

ll qpow(ll x,ll p){
    ll ret=1;
    for(;p;p>>=1,x=x*x%cys) if(p&1) ret=ret*x%cys;
    return ret;
}

void work(int u){
    for(int i=1;i<=n;i++){
        if(vis[p[u][i]]) continue;
        vis[p[u][i]]=1;
        num--;
        if(a[p[u][i]]==1){
            printf("lieren\n");
            return;
        }
        else if(a[p[u][i]]==0&&num<=2){
            printf("langren\n");
            return;
        }
        work(p[u][i]);
        break;
    }
}

int main(){
    int T=readint();
    while(T--){
        n=readint();
        for(int i=1;i<=n;i++) a[i]=readint();
        for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) p[i][j]=readint();
        int rt;
        for(int i=1;i<=n;i++) if(a[i]) rt=i;
        for(int i=1;i<=n;i++) vis[i]=0;
        num=n;
        work(rt);
    }
    return 0;
}