#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x) memset(x,0,sizeof(x))
#define printYes puts("Yes")
#define printYES puts("YES")
#define printNo puts("No")
#define printNO puts("NO")

const ll inf=1000000000000000000; 
const ll mod=998244353;
const int N=56;
int n,m,T; 
int a[N],s[N][N];
inline int read()
{
    int F=1,ANS=0;
    char C=getchar();
    while (C<'0'||C>'9')
    {
        if (C=='-') F=-1;
        C=getchar();
    }
    while (C>='0'&&C<='9')
    {
        ANS=ANS*10+C-'0';
        C=getchar();
    }
    return F*ANS;
}
inline char readchar()
{
    char C=getchar();
    while (C<33||C>126) C=getchar();
    return C;
}
inline int raed(){return read();}
bool used[N];
int shoot(int x)
{
    for (int i=1;i<=n;i++)
    {
        if (used[s[x][i]]==0) return s[x][i];
    }
}
void work()
{
    n=read();
    mem(used);
    int l=0;
    for (int i=1;i<=n;i++) 
    {
        a[i]=read();
        if (a[i]==1) l=i;
    } 
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<=n;j++)
        {
            s[i][j]=read();
        }
    }
    int p=n;
    while (1)
    {
        l=shoot(l);
        p--;
        used[l]=1;
        if (a[l]==1)
        {
            puts("lieren");
            return;
        }
        if (p<=2)
        {
            puts("langren");
            return;
        }
    }
    return;
}

int main()
{
    int tp=0;
    //0 : many test cases
    //1 : one test case
    if (tp==0) T=read();
    else T=1;
    while (T--)
    {
        work();
    }
    return 0;
}