#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
// #define F first
// #define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}

void Solve() {
    ll N;
    cin >> N;
    ll SUM = 0;
    vector<vector<ll>> A(N, vector<ll>(N));
    rep(i,0,N) {
        rep(j,0,N) cin >> A[i][j], SUM += A[i][j];
    }
    if (SUM % N != 0) {
        cout << -1 << endl;
        return;
    }
    if (N == 1) {
        cout << 1 << endl;
        return;
    }
    vector<pair<int,int>> P;
    if (N % 2 == 0) {
        rep(i,0,N) P.push_back({i,0});
        rrep(i,0,N) {
            if (i % 2 == 0) {
                rrep(j,1,N) P.push_back({i,j});
            }
            else {
                rep(j,1,N) P.push_back({i,j});
            }
        }
    }
    else {
        rep(i,0,N) P.push_back({i,0});
        rrep(i,2,N) {
            if (i % 2 == 1) {
                rrep(j,1,N) P.push_back({i,j});
            }
            else {
                rep(j,1,N) P.push_back({i,j});
            }
        }
        rrep(i,1,N) {
            if (i % 2 == 1) {
                P.push_back({0,i});
                P.push_back({1,i});
            }
            else {
                P.push_back({1,i});
                P.push_back({0,i});
            }
        }
    }
    vector<ll> Z(N*N+1,0), C(N,0);
    rep(i,0,N*N) {
        auto [x,y] = P[i];
        Z[i+1] = (Z[i] + A[x][y]) % N;
        C[Z[i]]++;
    }
    ll MAX = -1, ID = -1;
    rep(i,0,N) if (chmax(MAX, C[i])) ID = i;
    if (N % 2 == 1 && MAX == N && ID != Z[0] && ID == Z[1] && ID == Z[N*N-1]) {
        rep(i,0,N) {
            if (C[i] == MAX && i != Z[1]) {
                ID = i;
                break;
            }
        }
    }
    vector<int> V;
    rep(i,0,N*N) if (Z[i] == ID) V.push_back(i);
    V.resize(N);
    V.push_back(V[0]+N*N);
    vector<vector<int>> ANS(N, vector<int>(N, -1));
    rep(i,0,N) {
        rep(j,V[i],V[i+1]) {
            auto [x,y] = P[j%(N*N)];
            ANS[x][y] = i+1;
        }
    }
    rep(i,0,N) {
        rep(j,0,N) {
            cout << ANS[i][j] << (j+1==N?'\n':' ');
        }
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    ll _ = 1;
    cin>>_;
    while(_--){
        Solve();
    }
    return 0;
}