#include <algorithm>
#include <cstdio>

const int N = 2e3 + 5;
const int A1[3][3] = {
  {0, 1, 1},
  {2, 2, 1},
  {2, 1, 2}
};
const int A2[3][3] = {
  {1, 1, 2},
  {1, 2, 1},
  {0, 2, 2}
};
const int A3[3][3] = {
  {1, 2, 1},
  {2, 1, 1},
  {2, 2, 0}
};
const int A4[3][3] = {
  {1, 1, 0},
  {2, 1, 2},
  {1, 2, 2}
};
const int B[4][4] = {
  {1, 1, 2, 2},
  {1, 2, 3, 2},
  {4, 1, 4, 3},
  {4, 4, 3, 3}
};
const int C1[2][4] = {
  {1, 1, 2, 2},
  {1, 2, 1, 2}
};
const int C2[4][2] = {
  {1, 1},
  {1, 2},
  {2, 1},
  {2, 2}
};
const int D1[4][3] = {
  {1, 1, 0},
  {1, 2, 0},
  {0, 1, 2},
  {0, 2, 2}
};
const int D2[3][4] = {
  {0, 0, 1, 1},
  {2, 1, 2, 1},
  {2, 2, 0, 0}
};
const int D3[3][4] = {
  {2, 2, 0, 0},
  {2, 1, 2, 1},
  {0, 0, 1, 1}
};
const int E[3][2] = {
  {1, 1},
  {1, 0},
  {0, 1}
};

int ans;
int a[N][N];

void dfs(int X, int Y, int n) {
  if (n <= 2) return;
  auto write = [&](const auto &mod, int r, int c, int x, int y) {
    int nxt = 0;
    for (int i = 0; i < r; ++i) {
      for (int j = 0; j < c; ++j) {
        if (!mod[i][j]) continue;
        a[x + i][y + j] = ans + mod[i][j];
        nxt = std::max(nxt, mod[i][j]);
      }
    }
    ans += nxt;
  };
  if (n % 4 == 0) {
    for (int i = X; i < X + n; i += 4)
      for (int j = Y; j < Y + n; j += 4)
        write(B, 4, 4, i, j);
    return;
  }
  if (n == 3) return write(A1, 3, 3, X, Y);
  if (n % 4 == 2) {
    for (int i = X; i + 3 < X + n; i += 4)
      write(C2, 4, 2, i, Y + n - 2);
    for (int i = Y; i + 3 < Y + n; i += 4)
      write(C1, 2, 4, X + n - 2, i);
    return dfs(X, Y, n - 2);
  }
  if (n == 5) {
    write(A1, 3, 3, X, Y + 2);
    write(E, 3, 2, X, Y);
    return write(C1, 2, 4, X + 3, Y);
  }
  if (n % 4 == 3) {
    for (int i = X; i + 3 < X + n; i += 4)
      write(C2, 4, 2, i, Y + n - 2);
    for (int i = Y; i + 3 < Y + n; i += 4)
      write(C1, 2, 4, X + n - 2, i);
    write(A1, 3, 3, X + n - 3, Y + n - 3);
    return dfs(X, Y, n - 2);
  }
  if (n == 9) {
    write(C1, 2, 4, X, Y);
    write(C1, 2, 4, X + n - 2, Y + n - 4);
    write(C2, 4, 2, X, Y + n - 2);
    write(C2, 4, 2, X + n - 4, Y);
    write(A2, 3, 3, X, Y + 4);
    write(A1, 3, 3, X + n - 5, Y + n - 3);
    write(A3, 3, 3, X + 2, Y);
    write(A4, 3, 3, X + n - 3, Y + n - 4 - 3);
    write(D3, 3, 4, X + 2, Y + 3);
    write(D3, 3, 4, X + 4, Y + 2);
    return;
  }
  if (n % 4 == 1) {
    int j = 0;
    while (j + 3 < n - 5) {
      write(C1, 2, 4, X, Y + j);
      write(C1, 2, 4, X + n - 2, Y + j);
      j += 4;
    }
    write(D1, 4, 3, X, Y + j);
    write(A2, 3, 3, X, Y + j + 2);
    write(A1, 3, 3, X + n - 3, Y + j);
    write(C2, 4, 2, X + n - 4, Y + n - 2);
    write(D2, 3, 4, X + n - 6, Y + n - 4);
    for (int i = X + 4; i + 3 < X + n - 4; i += 4) {
      write(C2, 4, 2, i, Y + n - 4);
      write(C2, 4, 2, i - 1, Y + n - 2);
    }
    return dfs(X + 2, Y, n - 4);
  }
}

void solve() {
  int n;
  scanf("%d", &n);
  ans = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) a[i][j] = 0;
  dfs(1, 1, n);
  printf("%d\n", ans);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) printf("%d%c", a[i][j], " \n"[j == n]);
}

int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
  return 0;
}