#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <ctime>
#include <cmath>
using namespace std;
int T,n;
int mp[55][55];
bool dead[55];
int sf[55];
int get(){
    char t = getchar();
    while(t < '0' || t > '9')t=getchar();
    int x = 0;
    while(t>='0' && t <= '9'){
        x *= 10;
        x += t-'0';
        t = getchar();
    }
    return x;
}
int main(){
    T = get();
    for(int ii=1;ii<=T;++ii){
        n = get();
        memset(dead, 0, sizeof(dead));
        int langren = 0;
        for(int i=1;i<=n;++i){
            sf[i] = get();
            if(sf[i] == 1)langren = i;
        }
        for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)mp[i][j] = get();
        int killer = langren;
        int remain = n;
        for(int i=1;i<=n;++i){
            int kill = 0;
            for(int j=1;j<=n;++j){
                if(!dead[mp[killer][j]]){
                    kill = mp[killer][j];
                    break;
                }
            }
            if(kill == langren){
                printf("lieren\n");
                break;
            }else{
                remain --;
                if(remain <= 2){
                    printf("langren\n");
                    break;
                }
                dead[kill] = true;
                killer = kill;
            }
        }
        
         
    }
    return 0;
}