#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n,a[66][66],s1[66],s2[66];
bool chk(){
	For(i,1,n)For(j,1,n)if(a[i][j])return 0;
	return 1;
}

int bel[66],vis[66],q[66];
bool dfs(int u){
	if(vis[u])return 0;
	vis[u]=1;
	For(i,1,n)
		if(a[u][i]){
			if(!bel[i])return bel[i]=u,1;
			if(dfs(bel[i]))return bel[i]=u,1;
		}
	return 0;
}

void work()
{
	n=read();
	For(i,0,n)s1[i]=s2[i]=0;
	For(i,1,n)For(j,1,n)a[i][j]=read(),s1[i]+=a[i][j],s2[j]+=a[i][j];
	For(i,1,n)if(s1[i]!=s1[1])return puts("-1"),void();
	For(i,1,n)if(s2[i]!=s2[1])return puts("-1"),void();
	For(i,1,n)For(j,1,n)if(a[i][j]<0)return puts("-1"),void();
	vector<vi>out;
	while(!chk()){
		For(i,0,n)bel[i]=0;
		For(i,1,n){
			For(j,1,n)vis[j]=0;
			dfs(i);
		}
		int mn=inf;
		For(i,1,n){
			assert(bel[i]&&a[bel[i]][i]);
			mn=min(mn,a[bel[i]][i]);
			q[bel[i]]=i;
		}
		vi o; o.pb(mn);
		For(i,1,n)o.pb(q[i]);
		out.pb(o);
		For(i,1,n)a[bel[i]][i]-=mn;
	}
	cout<<out.size()<<"\n";
	for(auto it:out){
		for(auto x:it)cout<<x<<" ";
		cout<<"\n";
	}
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}