#include <bits/stdc++.h>
using namespace std;
int T, n;
int a[55][55], b[55];
int main() {
    scanf("%d", &T);
    while (T--) {
        int cnt = 0;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) scanf("%d", b + 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++) {
            if (b[i]) {
                int cur = a[i][1];
                while (cur != i) {
                    cnt++;
                    b[cur] = -1;
                    for (int j = 1; j <= n; j++) if (b[a[cur][j]] != -1) {
                        cur = a[cur][j];
                        break;
                    }
                }
                break;
            }
        }
        if (cnt >= n - 2) puts("langren");
        else puts("lieren");
    }
}