#include <cassert>
#include <iostream>
#include <functional>
#include <iomanip>
#include <set>
#include <numeric>
#include <unordered_map>
#include <map>
#include <queue>
#include <stack>
#include <complex>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath> 
#include <random>
#include <vector>

using namespace std;

using LL = long long;

const LL base = 1000000007;
const int MAX = 60;
int zs[MAX]  = {0};

int zg[MAX][MAX] = {0};
void solve() {
    int n ;
    cin >>n;
    int w = 0;
    for (int i=0; i<n; ++i) {
        cin>> zs[i];
        if (zs[i]) w = i + 1;
    }

    for (int i=0; i<n; ++i) for (int j=0; j<n; ++j) {
        cin>>zg[i+1][j];
    }
    bool zd[MAX] = {0};    
    int tot = 0;
    int f = zg[w][0];
    while (!zd[w] && tot+2 < n) {
        ++ tot;
        zd[f] = true;
        for (int i=0; i<n; ++i) if (!zd[zg[f][i]]) {
            f = zg[f][i] ;
            break;
        }
    }
    if (!zd[w]) {
        cout<<"langren\n";
    }
    else cout<<"lieren\n";
}

int main() {
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //int a = getct(gap + 123);
    //int b = getct2(gap+123);
    int T;
    cin >>T;
    for (int tp=0; tp<T; ++tp) {
        solve();
    }

}