#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589793238462643383;
const long long INF = 1e9 + 7;
const long long mod = 998244353;
int getID(char c) {
  if (c == ' ') return 0;
  return c - 'a' + 1;
}
int prime[] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29, 31, 37,  41, 43,
               47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
long long pw(long long a, long long b) {
  long long res = 1ll;
  while (b) {
    if (b & 1ll) res = (res * a) % INF;
    a = (a * a) % INF;
    b >>= 1;
  }
  return res % INF;
}
bool ispr(int n) {
  if (n < 2) return 0;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
void solve() {
  int n;
  cin >> n;
  int a[n][n];
  for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j < n - 1; j++) {
      a[i][j] = 0;
      if (i == n - 2 || j == n - 2) a[i][j] = 1;
    }
  }
  for (int i = 0; i < n - 1; i++) {
    a[n - 1][i] = 4;
    a[i][n - 1] = 4;
  }
  int vl;
  for (int i = 0; i < 10000; i++) {
    if (ispr(i)) continue;
    if (ispr(n - 1 + i)) {
      vl = i;
      break;
    }
  }
  a[n - 1][n - 2] = vl;
  a[n - 2][n - 1] = vl;
  vl += 4 * (n - 2);
  for (int i = 0; i < 10000; i++) {
    if (ispr(i)) continue;
    if (ispr(vl + i)) {
      a[n - 1][n - 1] = i;
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << a[i][j] << " ";
    }
    cout << "\n";
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
