#include <bits/stdc++.h>

using namespace std;

int T, n, a[51], b[51][51], rest, cur;

int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j)
        scanf("%d", &b[i][j]);
    for (int i = 1; i <= n; ++i)
      if (a[i])
        cur = b[i][1];
    while (!a[cur] && --n > 2) {
      a[cur] = -1;
      for (int i = 1; i; ++i)
        if (a[b[cur][i]] != -1) {
          cur = b[cur][i];
          break;
        }
    }
    puts(a[cur] ? "lieren" : "langren");
  }
  return 0;
}