#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
typedef long long LL;
const int N=55;
int a[N][N];
int b[N],n,id;
bool in[N];
bool solve (int nn,int y)
{
    in[y]=false;
//    printf("%d\n",y);
    if (y==id) return true;
    nn--;
    if (nn<=2) return false;
    in[y]=false;
    for (int u=1;u<=n;u++)
    if (in[a[y][u]])
    return solve(nn,a[y][u]);
}
int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d",&n);
        for (int u=1;u<=n;u++) scanf("%d",&b[u]);
        for (int u=1;u<=n;u++) in[u]=true;
        for (int u=1;u<=n;u++)
        for (int i=1;i<=n;i++)
        scanf("%d",&a[u][i]);
        for (int u=1;u<=n;u++)  if (b[u]==1) id=u;
        if (solve(n,a[id][1])) printf("lieren\n");
        else printf("langren\n");
    }
    return 0;
}