#include <bits/stdc++.h>
using namespace std;
long long int inline power(long long int a, long long int b, long long int p) {
  a %= p;
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) ans = (ans * a) % p;
    a = (a * a) % p;
    b >>= 1;
  }
  return ans;
}
long long int inv(long long int n, long long int p) {
  return power(n, p - 2, p);
}
bool inline isprime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n, i, j;
    cin >> n;
    int a[n][n];
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) a[i][j] = 0;
    }
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) {
        if (j == i || j == (n - 1 - i))
          a[i][j] = 1;
        else
          a[i][j] = 0;
      }
    }
    if (n % 2 != 0) {
      for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
          if (i == 0 && j == n / 2) a[i][j] = 1;
          if (i == (n - 1) && j == n / 2) a[i][j] = 1;
          if (i == n / 2 && j == 0) a[i][j] = 1;
          if (i == n / 2 && j == (n - 1)) a[i][j] = 1;
        }
      }
    }
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) cout << a[i][j] << " ";
      cout << "\n";
    }
  }
  return 0;
}
