#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=55;
int a[N][N],c[N];
bool vis[N];
int n;
void dfs(int x,int ans,int y)
{
    if(ans==n-2)
    {
        cout<<"langren"<<endl;
        return ;
    }
    for(int i=1;i<=n;i++)
    {
        int p=a[x][i];
        if(!vis[p])
        {
            if(p==y)
            {
                cout<<"lieren"<<endl;
                return;
            }
            vis[p]=1;
            dfs(p,ans+1,y);
            return ;
        }
    }
}
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        memset(vis,0,sizeof(vis));
        cin>>n;
        int x;
        for(int i=1;i<=n;i++)
        {
            cin>>c[i];
            if(c[i]==1)
                x=i;
        }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                cin>>a[i][j];
        if(a[x][1]==x)
        {
            cout<<"lieren"<<endl;
            continue;
        }
        vis[a[x][1]]=1;
        dfs(a[x][1],1,x);
    }
    return 0;
}