#include <cstdio>

const int MN = 55;

int N, w;
int p[MN], a[MN][MN], d[MN];

inline void Solve() {
    scanf("%d", &N);
    for (int i = 1; i <= N; ++i) {
        scanf("%d", &p[i]);
        if (p[i]) w = i;
    }
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
            scanf("%d", &a[i][j]);
    for (int i = 1; i <= N; ++i)
        d[i] = 0;
    int cnt = N - 1, q = a[w][1];
    d[q] = 1;
    while (!d[w] && cnt >= 3) {
        int v = 0;
        for (int j = 1; j <= N; ++j) if (!d[a[q][j]]) {
            v = a[q][j];
            break;
        }
        q = v;
        d[q] = 1;
        --cnt;
    }
    puts(d[w] ? "lieren" : "langren");
}

int main() {
    int Tests;
    scanf("%d", &Tests);
    while (Tests--) Solve();
    return 0;
}