#include <bits/stdc++.h>
#define N 52
using namespace std;
int T;
int n, id;
bool identity[N], dead[N];
int wolf, kill;
int wish[N][N];
int pos;
void solve() {
    memset(dead, false, sizeof(dead));
    memset(identity, false, sizeof(identity));
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &id);
        if (id == 1) {
            wolf = i;
            identity[i] = true;
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            scanf("%d", &wish[i][j]);
        }
    }
    kill = wish[wolf][1];
    do {
        dead[kill] = true;
        --n;
        pos = 1;
        while (dead[wish[kill][pos]]) {
            ++pos;
        }
        kill = wish[kill][pos];
    } while (n > 2 && !dead[wolf]);
    if (dead[wolf]) {
        printf("lieren\n");
    } else {
        printf("langren\n");
    }
}
int main() {
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}