#include <bits/stdc++.h>
using namespace std;

int n, a[55], p[55][55], d[55];

void solve() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) scanf("%d", &p[i][j]);
    memset(d, 0, sizeof d);
    int id = 0, cnt = n;
    for (int i = 1; i <= n; i++) if (a[i]) id = p[i][1];
    while (true) {
        d[id] = 1, cnt--;
        if (a[id]) {puts("lieren"); return ;}
        if (cnt <= 2) {puts("langren"); return ;}
        for (int i = 1; i <= n; i++)
            if (!d[p[id][i]]) {id = p[id][i]; break;}
    }
}

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