#include <bits/stdc++.h>
using namespace std;
int comp(int a) {
  for (int i = 2; i * i <= a; i++)
    if (a % i == 0) return true;
  return false;
}
void solve() {
  int n;
  cin >> n;
  int ans[n][n];
  for (int i = 0; i < n - 2; i++)
    for (int j = 0; j < n - 2; j++) ans[i][j] = 6;
  for (int i = 0; i < n - 1; i++) ans[i][n - 2] = ans[n - 2][i] = 9;
  int x;
  for (x = 4;; x += 2)
    if (!comp((n - 2) * 6 + 9 + x)) {
      for (int i = 0; i < n; i++) ans[i][n - 1] = ans[n - 1][i] = x;
      break;
    }
  for (int i = 9;; i += 2) {
    if (comp(i) and !comp(n * x - x + i)) {
      ans[n - 1][n - 1] = i;
      break;
    }
  }
  for (int i = 9;; i++) {
    if (comp(i) and !comp(n * 9 - 18 + ans[0][n - 1] + i)) {
      ans[n - 2][n - 2] = i;
      break;
    }
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cout << ans[i][j] << " \n"[j == n - 1];
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
}
