#include <cstdio>
#include <algorithm>
using std::scanf;
using std::printf;
using ll = long long;

const int MAXN=700+10;
int arr[MAXN*MAXN];
int board[MAXN][MAXN];
ll readint() { long long n; scanf("%lld", &n); return n; }
signed main() {
 int ntc = readint();
 for (int itc = 0; itc < ntc; ++itc) {
  int n = readint() - 1;
  for (int i = 0; i < n*n; ++i) arr[i] = readint();
  std::sort(arr, arr + n*n);
  for (int r=0;r<=n;++r)for (int c=0;c<=n;++c) board[r][c] = 0;
  for (int r=0;r<n;++r)for (int vc=0;vc<n;++vc) {
   int v = arr[r*n+vc];
   int c = r%2?n-1-vc:vc;
   int tgc = r%2?c:c+1;
   board[r+1][tgc]=v
    -board[r+0][c+0]
    -board[r+0][c+1]
    -board[r+1][c+0]
    -board[r+1][c+1]
   ;
  }
  for (int r=0;r<=n;++r)for (int c=0;c<=n;++c) printf("%d%c", board[r][c],c+1<=n?' ':'\n');

 }
 return 0;
}