#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long v[n][n];
  bool flag = (n % 2 == 0);
  long long x;
  if (!flag) {
    x = ceil((long double)n / 2);
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (i == j)
        v[i][j] = 1;
      else if (i + j == n - 1)
        v[i][j] = 1;
      else
        v[i][j] = 0;
      if (!flag) {
        v[x][x - 1] = 1;
        v[x - 1][x] = 1;
        v[x - 1][x - 2] = 1;
        v[x - 2][x - 1] = 1;
      }
      cout << v[i][j] << ' ';
    }
    cout << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  long long test = 1;
  cin >> test;
  while (test--) {
    solve();
  }
  return 0;
}
