#include <bits/stdc++.h>
using namespace std;
const int sz = 1e5 + 100;
bool is_prime(int n) {
  for (int i = 2; i < n; i++) {
    if ((n % i) == 0) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int a, b, c, i, j, k, q, p, x, y, ct, ct1, m, l, r, x1, y1, h, sum1, in, z,
      mid, n, mx;
  char ch;
  double d;
  string str1, str2, str;
  bool bl, bl1;
  int t, cs = 1;
  cin >> t;
  while (t--) {
    cin >> n;
    if (is_prime(n) == true) {
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) cout << 1 << " ";
        cout << endl;
      }
    } else {
      int i = n + 1;
      while (i) {
        if (is_prime(i) && (is_prime(i - n + 1) == false)) break;
        ++i;
      }
      int x = i - (n - 1);
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
          if (i == j)
            cout << x << " ";
          else
            cout << 1 << " ";
        }
        cout << endl;
      }
    }
  }
}
