#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) cout<<i<<" ";puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
    ll x=0,f=1;char c=getchar();
    while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
    if (c=='-') f=-1,c=getchar();
    while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
    return x*f;
}

const int N = 55;
int n,a[N][N];
bool vis[N];
inline void solve(){
    n=read();
    int lr=0;
    For(i,1,n){
        int x=read();
        vis[i]=1;
        if (x==1) lr=i;
    }
    For(i,1,n) For(j,1,n) a[i][j]=read();
    int now=lr,cnt=n;
    while (233){
        For(i,1,n) if (vis[a[now][i]]){
            vis[a[now][i]]=0,now=a[now][i],--cnt;
            break;
        }
        if (now==lr) return puts("lieren"),void(0);
        if (cnt<=2) return puts("langren"),void(0);
    }
}

int main(){
    int T=read();
    while (T--) solve();
}