#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
long long int power(long long int x, long long int y) {
  long long int res = 1;
  x = x % mod;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    y = y >> 1;
    x = (x * x) % mod;
  }
  return res;
}
long long int ad(long long int a, long long int b) {
  return ((a % mod + b % mod) % mod);
}
long long int sub(long long int a, long long int b) {
  return ((a % mod - b % mod + mod) % mod);
}
long long int row[] = {-1, 0, 0, 1};
long long int col[] = {0, -1, 1, 0};
bool check(long long int n) {
  if (n <= 1) return false;
  for (long long int i = 2; i < n; i++)
    if (n % i == 0) return false;
  return true;
}
void solve() {
  long long int n;
  cin >> n;
  long long int a[n][n];
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) a[i][j] = 1;
  }
  long long int i = 1, w = n - 1;
  while (1) {
    if (check(w + i) && !check(i)) break;
    i++;
  }
  for (long long int j = 0; j < n; j++) {
    a[j][n - 1] = i;
    a[n - 1][j] = i;
  }
  long long int u = i * (n - 1);
  long long int v = 1;
  while (1) {
    if (check(u + v) && !check(v)) break;
    v++;
  }
  a[n - 1][n - 1] = v;
  for (i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) cout << a[i][j] << " ";
    cout << endl;
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
