//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define si inline
using namespace std;
typedef long long ll;typedef __int128 li;typedef long double ld;
typedef unsigned long long ull;typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,true;return false;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,true;return false;}

namespace LinkWish{

	ci N=505;

	int n;
	bool e[N][N];

	int dis[N];
	void bfs(int s){
		for(int i=1;i<=n;i++)dis[i]=-1;
		queue<int> q;
		q.push(s),dis[s]=0;
		while(!q.empty()){
			int now=q.front();q.pop();
			for(int i=1;i<=n;i++)
				if(e[now][i]&&dis[i]==-1)dis[i]=dis[now]+1,q.push(i);
		}
	}

	si void solve(){
		cin>>n;
		for(int i=1;i<=n;i++){
			string s;cin>>s;
			for(int j=1;j<=n;j++){
				e[i][j]=(s[j-1]=='1');
			}
		}
		for(int i=1;i<=n;i++){
			bfs(i);
			for(int j=1;j<=n;j++)
				if((int)e[i][j]!=(dis[j]&1)||dis[j]==-1)
					return cout<<"Track Lost\n",void();
		}
		cout<<"Pure Memory\n";
		vector<pii> edge;
		for(int i=1;i<=n;i++)
			for(int j=i+1;j<=n;j++)
				if(e[i][j])edge.emplace_back(i,j);
		cout<<edge.size()<<endl;
		for(pii i:edge)cout<<i.fi<<' '<<i.se<<endl;
	}

	void mian(){
		int TT;cin>>TT;
		while(TT--)solve();
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	assert(freopen("bridge.in","r",stdin));
	assert(freopen("bridge.out","w",stdout));
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}