#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    VVI a(n, VI(n));
    rep(i, n) rep(j, n) cin >> a[i][j];
    int sm = 0;
    rep(i, n) rep(j, n) sm = (sm + a[i][j]) % n;
    if (sm != 0) {
      cout << -1 << '\n';
      continue;
    }
    vector<P> left, right;
    int ls = 0, rs = 0;
    rep(i, n) {
      if (i == n - 1) {
        rep(j, n) a[i][j] = i;
        for (auto [x, y] : left) a[x][y] = i;
        for (auto [x, y] : right) a[x][y] = i;
        continue;
      }
      VI last(n, -1);
      last[0] = 0;
      int now = 0;
      rep(j, n) {
        now += a[i][j];
        if (j == 0) now += ls;
        else if (j == n - 1) now += rs;
        now %= n;
        if (last[now] == -1) {
          last[now] = j + 1;
          continue;
        }
        int l = last[now], r = j + 1;
        for (int j = l; j < r; j++) a[i][j] = i;
        if (l == 0) {
          for (auto [x, y] : left) a[x][y] = i;
          ls = 0;
          left.clear();
        } else {
          for (int j = 0; j < l; j++) left.emplace_back(i, j), ls = (ls + a[i][j]) % n;
        }
        if (r == n) {
          for (auto [x, y] : right) a[x][y] = i;
          rs = 0;
          right.clear();
        } else {
          for (int j = r; j < n; j++) right.emplace_back(i, j), rs = (rs + a[i][j]) % n;
        }
        break;
      }
    }
    rep(i, n) rep(j, n) cout << a[i][j] + 1 << " \n"[j + 1 == n];
  }
}