#include <bits/stdc++.h>
using namespace std;

const int N = 510;
int T, n; bool mp[N][N]; int dis[N][N];
inline void sol()
{
	cin >> n; int cnt = 0;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			mp[i][j] = false;
	for(int i = 1; i <= n; ++i)
	{
		for(int j = 1; j <= n; ++j)
		{
			char c; cin >> c;
			mp[i][j] = c - '0';
			if(mp[i][j]) dis[i][j] = 1, cnt += (i < j);
			else if(i != j) dis[i][j] = 1e9;
			else dis[i][j] = 0;
		}
	}
	for(int k = 1; k <= n; ++k)
		for(int i = 1; i <= n; ++i)
			for(int j = 1; j <= n; ++j)
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			if(dis[i][j] > n || (dis[i][j] & 1) != mp[i][j])
				{cout << "Track Lost" << '\n'; return ;}
	cout << "Pure Memory" << '\n';
	cout << cnt << '\n';
	for(int i = 1; i <= n; ++i)
		for(int j = i + 1; j <= n; ++j)
			if(mp[i][j])
				cout << i << " " << j << '\n';
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> T;
	while(T--) sol();
	return 0;
}
/*

*/