#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int N = 100;

queue<int> que[N];
bool die[N];

int GetDie(int x) {
    while (die[que[x].front()]) que[x].pop();
    return que[x].front();
}

void solve() {
    int n;
    int lang = 0;
    scanf("%d", &n);
    std::fill(die+1, die+n+1, false);
    for (int i = 1; i <= n; i++) {
        int x;
        scanf("%d", &x);
        if (x) lang = i;
    }
    assert(lang);

    for (int i = 1; i <= n; i++) {
        while (!que[i].empty()) que[i].pop();
        for (int j = 1; j <= n; j++) {
            int x;
            scanf("%d", &x);
            que[i].push(x);
        }
    }

    int curdie = que[lang].front();
    int left = n;

    while (left > 2) {
        if (curdie == lang) {
            printf("lieren\n");
            return ;
        }
        left--;
        die[curdie] = true;
        int nexdie = GetDie(curdie);
        curdie = nexdie;
    }
    printf("langren\n");
}

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