#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 57;
int n, p[N];
ll a[N][N];
ll sx[N], sy[N];
void Main() {
	cin >> n;
	me(sx, 0), me(sy, 0);
	L(i, 1, n) {
		L(j, 1, n) {
			cin >> a[i][j];
			sx[i] += a[i][j];
			sy[j] += a[i][j];
		}
	} 
	L(i, 1, n) if(sx[i] != sx[1] || sy[i] != sy[1]) {
		cout << -1 << '\n';
		return ;
	}
	cout << n * n - 2 * n + 2 << '\n';
	L(i, 1, n) {
		L(j, 1, i - 2) {
			int w = a[i][j];
			cout << w << ' ';
			L(k, 1, j - 1) p[k] = k;
			L(k, i + 1, n) p[k] = k;
			p[i] = j;
			L(k, j, i - 1) p[k] = k + 1;
			L(k, 1, n) cout << p[k] << ' ', a[k][p[k]] -= w;
			cout << '\n';
		}
	}
	
	L(i, 1, n) {
		L(j, i + 1, n) {
			int w = a[i][j];
			cout << w << ' ';
			L(k, 1, i - 1) p[k] = k;
			L(k, j + 1, n) p[k] = k;
			p[i] = j;
			L(k, i + 1, j) p[k] = k - 1;
			L(k, 1, n) L(t, k + 1, n) assert(p[k] != p[t]);
			L(k, 1, n) cout << p[k] << ' ', a[k][p[k]] -= w;
			cout << '\n';
		}
	}
	int w = a[1][1];
	cout << w << ' ';
	L(i, 1, n) cout << i << ' ', a[i][i] -= w;
	cout << '\n';
	L(i, 1, n) L(j, 1, n) assert(!a[i][j]);
}

int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0); 
	int t;
	cin >> t;
	while(t--) Main();
	return 0;
}