#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define L(i,u) for (int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (int i=(a); i<=(b); i++)
#define per(i,a,b) for (int i=(a); i>=(b); i--)
typedef long double ld;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
    x=0; char c=getchar(); int f=1;
    while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
    while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> T gcd(T a, T b){return !b?a:gcd(b,a%b);}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
template<class T> inline T Abs(const T &x){return x>0?x:-x;}
inline ui R() {
    static ui seed=416;
    return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 55;
int n,p,a[N][N];bool gg[N];
int main() {
    int T;read(T);while(T--){
        int _;read(n);rep(i,1,n){read(_);if(_)p=i;}
        rep(i,1,n)rep(j,1,n)read(a[i][j]),gg[i]=0;
        int cnt=n,x=a[p][1];bool bo=0;
        while(cnt>2){
            if(x==p){bo=1;break;}
            gg[x]=1;cnt--;
            if(cnt==2)break;
            rep(i,1,n)if(!gg[a[x][i]]){x=a[x][i];break;}
        }
        printf("%s\n",bo?"lieren":"langren");
    }
    return 0;
}