#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
constexpr int inf = numeric_limits < int >::max() >> 1;
int n, m, a[509][509], b[509][509]; char c;
inline void work()
{
	cin >> n, m = 0;
	For(i, 1, n) For(j, 1, n) cin >> c, a[i][j] = c - '0';
	For(i, 1, n) For(j, 1, n) m += a[i][j], b[i][j] = a[i][j] ? 1 : i == j ? 0 : inf;
	For(k, 1, n) For(i, 1, n) if ( i != k ) For(j, 1, n) if ( i != j && j != k )
		b[i][j] = min(b[i][j], b[i][k] + b[k][j]);
	For(i, 1, n) For(j, 1, n)
		if ( b[i][j] == inf || a[i][j] != ( b[i][j] & 1 ) ) { cout << "Track Lost\n"; return; }
	cout << "Pure Memory\n" << ( m >> 1 ) << '\n';
	For(i, 1, n) For(j, i + 1, n) if ( a[i][j] ) cout << i << ' ' << j << '\n';
}
int main()
{
	// freopen("bridge.in", "r", stdin), freopen("bridge.out", "w", stdout);
	cin.tie(nullptr) -> sync_with_stdio(false);
	int t; cin >> t; while ( t-- ) work(); return 0;
}