#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define maxn 55
#define mod 9901
#define lowbit(x) x&-x

using namespace std;

const int inf=0x7fffffff;

int n,flag[maxn],t[maxn][maxn];
bool alive[maxn];

int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        int n,now;
        scanf("%d",&n);
        for (int i=1;i<=n;i++)
        {
            scanf("%d",&flag[i]);
            if (flag[i]==1) now=i;
        }
        memset(alive,1,sizeof(alive));
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++) scanf("%d",&t[i][j]);
        int cnt=n;
        bool f=0;
        while (cnt>2)
        {
            int i=1;
            while (!alive[t[now][i]]) i++;
            alive[t[now][i]]=0;
            cnt--;
            if (flag[t[now][i]])
            {
                f=1; //lieren
                break;
            }
            now=t[now][i];
        }
        if (f) printf("lieren\n");
        else printf("langren\n");
    }
    return 0;
}