#include <bits/stdc++.h>

void solve() {
    int n;
    std::cin >> n;
    std::vector<int> a(n);
    int x = 0;
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
        if (a[i]) {
            x = i;
        }
    }
    std::vector<std::vector<int>> p(n, std::vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            std::cin >> p[i][j];
            --p[i][j];
        }
    }
    
    int now = p[x][0];
    int cnt = n;
    while (a[x] != -1 && cnt > 2) {
        a[now] = -1;
        --cnt;
        if (now == x) {
            break;
        }
        for (int i = 0; i < n; ++i) {
            if (a[p[now][i]] != -1) {
                now = p[now][i];
                break;
            }
        }
    }
    if (a[x] == -1) {
        std::cout << "lieren\n";
    } else {
        std::cout << "langren\n";
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(0);

    int T;
    std::cin >> T;
    while (T--) {
        solve();
    }
}