#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int dy[] = {-1, 0, 1, 0};
int dx[] = {0, 1, 0, -1};
int n;
string s[110];

bool is_valid(int y, int x, int d) {
  if (y < 0 || y >= n || x < 0 || x >= n) return false;
  for (int i = 0; i < 4; i++) {
    int ny = y + dy[i], nx = x + dx[i];
    if (i == (d + 2) % 4) continue;
    if (ny >= 0 && ny < n && nx >= 0 && nx < n && s[ny][nx] == '#') return false;
  }
  return true;
}

void solve() {
  cin >> n;
  fill_n((string*)s, 110, string(n, ' '));
  int y = n - 1, x = 0, d = 0;
  while (true) {
    s[y][x] = '#';
    if (!is_valid(y + dy[d], x + dx[d], d)) (d += 1) %= 4;
    if (!is_valid(y + dy[d], x + dx[d], d)) break;
    y += dy[d], x += dx[d];
  }
  for (int i = 0; i < n; i++) {
    cout << s[i] << endl;
  }
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int d;
  cin >> d;
  for (int i = 0; i < d; i++) {
    if (i) cout << endl;
    solve();
  }  

  return 0;
}
