#include<bits/stdc++.h>
using namespace std;
using pi=pair<int,int>;
#define fi first
#define se second
const int N=505;
int n,d[N][N];
string a[N];
void bfs(int s,int *d) {
    queue<int>q;q.push(s),d[s]=0;
    while(q.size()) {
        int x=q.front();q.pop();
        for(int i=1;i<=n;i++)if(a[x][i]=='1'&&d[i]==-1)d[i]=d[x]+1,q.push(i);
    }
}
void solve() {
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],a[i]=' '+a[i];
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)d[i][j]=-1;
    for(int i=1;i<=n;i++)bfs(i,d[i]);
    bool fl=1;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(d[i][j]==-1||d[i][j]%2+'0'!=a[i][j])fl=0;
    if(!fl)cout<<"Track Lost\n";
    else {
        cout<<"Pure Memory\n";
        vector<pi>as;
        for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)if(a[i][j]=='1')as.push_back({i,j});
        cout<<as.size()<<'\n';
        for(pi i:as)cout<<i.fi<<' '<<i.se<<'\n';
    }
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int tt;cin>>tt;
    while(tt--)solve();
    return 0;
}