#include <bits/stdc++.h>
using namespace std;
int hcf(int a, int b) {
  if (!a)
    return (b);
  else
    return (hcf(b % a, a));
}
int lcm(int a, int b) { return ((a * b) / hcf(a, b)); }
long long isP(long long n) {
  if (n == 0 || n == 1) return 0;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long num;
    for (long long i = 10000; 10000 < 4 ? i < 4 : i > 4;
         10000 < 4 ? i += 1 : i -= 1) {
      if (isP(i) == 1) {
        num = i;
        break;
      }
    }
    long long a[100005];
    for (long long i = 0; i < n - 1; i++) {
      a[i] = 4;
    }
    if (isP(num - 4 * (n - 1)) == 1) {
      a[n - 2] += 5;
      num -= 5;
      a[n - 1] = num;
    }
    a[n - 1] = (num - 4 * (n - 1));
    long long b[100005];
    for (long long i = 0; i < n; i++) {
      b[i] = a[i];
    }
    for (long long i = n; n < 2 * n ? i < 2 * n : i > 2 * n;
         n < 2 * n ? i += 1 : i -= 1) {
      b[i] = a[i - n];
    }
    long long arr[105][105];
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) {
        arr[i][j] = b[i + j];
      }
    }
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) {
        cout << arr[i][j] << " ";
      }
      cout << endl;
    }
  }
  return 0;
}
