#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stdlib.h>
typedef long long ll;
using namespace std;
int a[100]; //shenfen
int biaoji[100];
int b[100][100];
int main(){
    int t;
    cin >> t;
    while(t--){
        memset(biaoji, 0, sizeof(biaoji));
        int n;
        cin >> n;
        int x=0,y=0;
        for (int i=1;i<=n;i++){
            cin >> a[i]; //0是猎人，1是狼人
            if(a[i] == 1) x=i;
        }
        int sum = 0;
        int flag = 0;
        for (int i=1;i<=n;i++){
            for (int j=1;j<=n;j++){
                cin >> b[i][j];
            }
            if(i==x){
                y = b[i][1]; //第一个死亡的人
                if(y == x){  //死亡的是狼人
                    cout << "lieren" << endl;
                    flag = 1;
                }
                else { //死亡的是猎人
                    biaoji[y] = 1;
                    sum++;//猎人死亡数++
                    if(sum + 2 >= n){
                        cout << "langren" << endl;
                        flag = 1;
                    }
                }
            }
        }
//        cout << x << " " << y << endl;
//        for (int i=1;i<=n;i++){
//            for (int j=1;j<=n;j++){
//                cout << b[i][j] << " ";
//            }
//            cout << endl;
//        }
        if(flag == 1){
            continue;
        }
        for (int i=1;i<=n;i++){
            if(flag == 1) break;
            for (int j=1;j<=n;j++){
                int z = b[y][j];
                if(biaoji[z] == 1){
                    continue;
                }
                else{
                    biaoji[z] = 1;
                    if(z == x){ //狼人死亡
                        flag = 1;
                        cout << "lieren" << endl;
                        break;
                    }
                    else { //猎人死亡
                        sum++;
                        if(sum + 2 >= n){
                            cout << "langren" << endl;
                            flag = 1;
                            break;
                        }
                        else {
                            y = z;
                            break;
                        }
                    }
                }
            }
        }
    }
    return 0;
}