#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
long long pows(long long a, long long n, long long m) {
  long long res = 1;
  while (n) {
    if (n % 2 != 0) {
      res = (res * a) % m;
      n--;
    } else {
      a = (a * a) % m;
      n = n / 2;
    }
  }
  return res % m;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
bool isprime(long long n) {
  if (n == 1) {
    return false;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
bool istrue(string s) {
  int i = 0;
  int j = s.size() - 1;
  while (i < j) {
    if (s[i] == s[j]) {
      i++;
      j--;
    } else {
      return false;
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[101][101];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        a[i][j] = 0;
      }
    }
    if (n % 2 == 0) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          if (i == j) {
            a[i][j] = 1;
          }
        }
      }
      int cnt = 0;
      int l = n - 1;
      int r = 0;
      while (cnt < n) {
        cnt++;
        a[l][r] = 1;
        l--;
        r++;
      }
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          cout << a[i][j] << " ";
        }
        cout << endl;
      }
    } else {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          if (i == j) {
            a[i][j] = 1;
          }
        }
      }
      int cnt = 0;
      int l = n - 1;
      int r = 0;
      while (cnt < n) {
        cnt++;
        a[l][r] = 1;
        l--;
        r++;
      }
      int p = n / 2;
      a[p][0] = 1;
      a[0][p] = 1;
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          cout << a[i][j] << " ";
        }
        cout << endl;
      }
    }
  }
}
