#include<bits/stdc++.h>
using namespace std;
using LL = long long;
const int mo = 1e9 + 7;
const int maxn = 5e6 + 5;


int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        int n;
        scanf("%d", &n);
        int ok;
        int x;
        for(int i = 1; i <= n; i++) {
            scanf("%d", &x);
            if(x == 1) {
                ok = i;
            }
        }
        vector< vector<int> > v;
        v.resize(n + 1);
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                scanf("%d", &x);
                v[i].push_back(x);
            }
        }
        set<int> se;
        if(v[ok][0] == ok) {
            printf("lieren\n");
            continue;
        }
        int now = v[ok][0];
        se.insert(now);
        while(se.size() + 2 < n) {
            for(auto &x: v[now]) {
                if(se.find(x) == se.end())
                {
                    now = x;
                    se.insert(x);
                    break;
                }
            }
            if(se.find(ok) != se.end()) {
                break;
            }
        }
        if(se.find(ok) == se.end()) {
            printf("langren\n");
        }
        else {
            printf("lieren\n");
        }
    }
    return 0;
}