#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int test;
  std::cin >> test;
  while (test--) {
    int N;
    std::cin >> N;
    std::vector<std::vector<int>> G(N, std::vector<int>(N, 1E8));
    std::vector<std::vector<int>> S(N, std::vector<int>(N));
    std::vector<std::pair<int, int>> edges;
    for (int u = 0; u < N; u++) {
      G[u][u] = 0;
      for (int v = 0; v < N; v++) {
        char c;
        std::cin >> c, S[u][v] = c - '0';
        if (c == '1' && v > u) {
          edges.emplace_back(u, v);
          G[u][v] = G[v][u] = 1;
        }
      }
    }
    for (int k = 0; k < N; k++) {
      for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
          G[i][j] = std::min(G[i][j], G[i][k] + G[k][j]);
        }
      }
    }
    bool ok = true;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        if (G[i][j] > N || (G[i][j] & 1) != S[i][j]) { ok = false; }
      }
    }
    if (ok) {
      std::cout << "Pure Memory\n";
      std::cout << edges.size() << '\n';
      for (auto t: edges) {
        std::cout << t.first + 1 << ' ' << t.second + 1 << '\n';
      }
    } else {
      std::cout << "Track Lost\n";
    }
  }

  return 0;
}