#include <bits/stdc++.h>
using namespace std;
int a[100];
int k[100][100];
int main ()
{
    int t;
    cin>>t;
    while(t--){
        int n;
        scanf("%d",&n);
        int lang;
        int num = n;
        for(int i = 1;i<=n;i++){
            scanf("%d",&a[i]);
            if(a[i]==1) lang = i;
            a[i] = 1;
        }
        for(int i = 1;i<=n;i++){
            k[i][0] = 1;
            for(int j = 1;j<=n;j++){
                scanf("%d",&k[i][j]);
            }
        }
        int ll = 1;
        int x = k[lang][k[lang][0]];
        a[x] = 0;
        if(x==lang){        
            cout<<"lieren"<<endl;
            continue;
        }
        num--;
        while(num>2){
            while(a[k[x][k[x][0]]]==0&&k[x][0]<=n){
                k[x][0]++;
            }
            a[k[x][k[x][0]]] = 0;
            if(a[lang]==0){
                ll = 0;
                break;
            }
            num--;
            if(num==2) break;
            x = k[x][k[x][0]];
        }
        
        if(ll==0) cout<<"lieren"<<endl;
        else cout<<"langren"<<endl;
    }
    
    
    
    
    
    
    return 0;
}