#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n;
int a[N], b[N][N], al [N];
void work() {
    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", b[i] + j);
    }
    for (int i = 1; i <= n; i++) al[i] = 1;
    int alive = n;
    for (int l = 1; l <= n; l++) if (a[l]) {
        int dead = b[l][1];
        while (true) {
            alive--;
            al[dead] = 0;
            if (a[dead] == 0 && alive <= 2) {
                puts("langren");
                return;
            }
            else if (a[dead] == 1) {
                puts("lieren");
                return;
            }
            for (int i = 1; i <= n; i++) if (al[b[dead][i]]) {
                dead = b[dead][i];
                break;
            }
        }
    }
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) work();
}