#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 50 + 7;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);

int n;

int f[maxn];

int a[maxn][maxn];

bool vis[maxn]; int res;

void func(int x){
    res = n; memset(vis+1, 0, n);
    while(true){
        int y;
        for(int i=1;i<=n;i++) if(!vis[a[x][i]]) { y = a[x][i]; break; }

        vis[y] = true;

        if(f[y]) { printf("lieren\n"); return; }
        else if(--res <= 2) { printf("langren\n"); return; }

        x = y;
    }
}

int main(){
    //freopen("in.txt", "r", stdin);
    int T; cin >> T;
    while(T--){
        scanf("%d",&n);
        int x;
        for(int i=1;i<=n;i++) {
            scanf("%d",&f[i]);
            if(f[i]) x = i;
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++) scanf("%d",&a[i][j]);
        }

        func(x);
    }
    return 0;
}