#include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=5e2+3;
int g[N][N];
int n;
bool f[N][N];
void solve(){
    cin>>n;int cnt=0;
    for(int i=1;i<=n;++i){
        string s;cin>>s;s="#"+s;
        for(int j=1;j<=n;++j){
            g[i][j]=(s[j]=='1'?1:INF);
            f[i][j]=(s[j]=='1');
            cnt+=f[i][j];
        }
    }
    for(int k=1;k<=n;++k)
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            if(g[i][j]==INF||g[i][j]%2!=f[i][j]){
                puts("Track Lost");return;
            }
    printf("Pure Memory\n%d\n",cnt/2);
    for(int i=1;i<=n;++i)
        for(int j=i+1;j<=n;++j)
            if(f[i][j])printf("%d %d\n",i,j);
}
int main(){
    int u,v,w,x,y,z;
    // freopen("bridge.in","r",stdin);
    // freopen("bridge.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int T;for(cin>>T;T--;)solve();
    return 0;
}