#include<bits/stdc++.h>
using namespace std;
int T, n, m;
string s[505];
int dis[505][505];
vector<int> G[505];
queue<int> q;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin >> T;
	while (T--){
		m = 0;
		cin >> n;
		for (int i = 1; i <= n; i++){
			G[i].clear();
			cin >> s[i];
			s[i] = " " + s[i];
		}
		for (int i = 1; i <= n; i++)
			for (int j = i + 1; j <= n; j++)
				if (s[i][j] == '1'){
					G[i].push_back(j);
					G[j].push_back(i);
				}
		memset(dis, -1, sizeof dis);
		for (int i = 1; i <= n; i++){
			q.push(i);
			dis[i][i] = 0;
			while (!q.empty()){
				int u = q.front();
				q.pop();
				for (auto v : G[u])
					if (dis[i][v] == -1){
						dis[i][v] = dis[i][u] + 1;
						q.push(v);
					}
			}
		}
		bool chk = 0; 
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++){
				if (dis[i][j] == -1 || dis[i][j] & 1 != s[i][j] - '0')
					chk = 1;
			}
		if (chk == 1)
			cout << "Track Lost\n";
		else{
			cout << "Pure Memory\n";
			for (int i = 1; i <= n; i++)
				for (auto v : G[i])
					if (v > i)
						m++;
			cout << m << "\n";
			for (int i = 1; i <= n; i++)
				for (auto v : G[i])
					if (v > i)
						cout << i << " " << v << "\n";
		}
	}
	return 0;	
}