/**
	author:  shobonvip
	created: 2026.09.19 13:32:44
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

void solve() {
	int n; cin >> n;
	vector<vector<int>> a(n,vector<int>(n));
	int sm = 0;
	rep(i,0,n)rep(j,0,n){
		cin>>a[i][j];
		sm+=a[i][j];
		sm%=n;
	}

	if (sm!=0) {
		cout << -1 << '\n';
		return;
	}

	vector<vector<pair<int,int>>> path;

	if (n%2==0) {
		rep(i,0,n){
			if (i%2==0) {
				rep(j,1,n) {
					path.emplace_back(vector<pair<int,int>>{pair(i,j)});
				}
			}else{
				rrep(j,1,n) {
					path.emplace_back(vector<pair<int,int>>{pair(i,j)});
				}
			}
		}
		rrep(i,0,n) {
			path.emplace_back(vector<pair<int,int>>{pair(i,0)});
		}
	} else {
		rep(i,0,n-2){
			if (i%2==0) {
				rep(j,1,n) {
					path.emplace_back(vector<pair<int,int>>{pair(i,j)});
				}
			}else{
				rrep(j,1,n) {
					path.emplace_back(vector<pair<int,int>>{pair(i,j)});
				}
			}
		}
		rrep(j,1,n) {
			if ((n-1-j)%2==0) {
				path.emplace_back(vector<pair<int,int>>{pair(n-2,j)});
				path.emplace_back(vector<pair<int,int>>{pair(n-1,j)});
			}else{
				path.emplace_back(vector<pair<int,int>>{pair(n-1,j)});
				path.emplace_back(vector<pair<int,int>>{pair(n-2,j)});
			}
		}
		path.emplace_back(vector<pair<int,int>>{pair(n-2,0),pair(n-1,0)});
		rrep(i,0,n-2) {
			path.emplace_back(vector<pair<int,int>>{pair(i,0)});
		}
	}

	vector<int> rui((int)path.size());
	rep(i,0,(int)path.size() - 1) {
		rui[i+1] = rui[i];
		for (auto [x,y]:path[i]) {
			rui[i+1] += a[x][y];
			rui[i+1] %= n;
		}
	}		
	vector<int> cnt(n);
	rep(i,0,(int)path.size()) {
		cnt[rui[i]] += 1;
	}

	int ind = -1;
	rep(i,0,n) {
		if (cnt[i] >= n) {
			ind = i;
		}
	}

	assert(ind >= 0);
	int giv = 0;
	vector<vector<int>> ans(n,vector<int>(n,-1));

	rep(i,0,(int)path.size()) {
		if (rui[i] == ind) giv = min(n, giv + 1);
		for (auto[x,y]: path[i]) {
			ans[x][y] = giv;
		}
	}

	rep(i,0,n) {
		rep(j,0,n) {
			cout << ans[i][j] % n + 1;
			if (j==n-1) cout << '\n';
			else cout << ' '; 
		}
	}





}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	// 偶数…ハミルトン閉路を取る。鳩ノ巣より、累積和があるmodのところが N 個以上あるだろう
	// 奇数だと1個たりない... ということもなく.


	int t; cin >> t;
	while(t--) solve();
}