#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t = 1,n,m,k,q,l,r,a[59],v[59],b[59][59],c,u,x,y,z,mod = 1e9 + 7;
string s;
struct st{ll x,y; /*bool operator < (const st &a) const{return x < a.x;};*/};
bool cmp(const st &a,const st &b){return a.x < b.x;}
inline ll read(){
    ll s = 0,w = 1;
    char ch = getchar();
    while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
    while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
    return s * w;
}
ll qp(ll x,ll y){
    ll a = 1,b = x;
    while (y){
        if (y & 1) a = a * b % mod;
        b = b * b % mod,y >>= 1;
    }
    return a;
}
int main(){t = read();
while (t --){
    n = read(); ll pos = 0;
    for (ll i = 1;i <= n;i += 1) a[i] = read(),pos = (a[i] ? i : pos),v[i] = 0;
    for (ll i = 1;i <= n;i += 1) for (ll j = 1;j <= n;j += 1) b[i][j] = read();
    ll cur = b[pos][1],rem = n;
    while (1){
        if (rem <= 2){puts("langren"); break;}
        if (cur == pos){puts("lieren"); break;}
        v[cur] = 1,rem -= 1;
        for (ll i = 1;i <= n;i += 1) if (!v[b[cur][i]]){cur = b[cur][i]; break;}
    }
}
    return 0;
}