#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

constexpr int N = 55;

int a[N][N];

void Do23(int x, int y, int v) {
  for (int i = 0; i < 2; ++i)
    for (int j = 0; j < 3; ++j)
      a[x + i][y + j] = v;
}
void Do32(int x, int y, int v) {
  for (int i = 0; i < 3; ++i)
    for (int j = 0; j < 2; ++j)
      a[x + i][y + j] = v;
}

int solve(int u, int d, int l, int r, int x) {
  if (r - l == d - u) {
    if (r - l == 1) {
      assert(false);
    } else if (r - l == 2) {
    } else if (r - l == 3) {
      Do32(u, l, x++);
    } else if (r - l == 4) {
      Do32(u, l, x++);
      Do32(u, l + 2, x++);
    } else if (r - l == 5) {
      Do32(u, l, x++);
      Do32(u + 2, l + 3, x++);
      Do23(u, l + 2, x++);
      Do23(u + 3, l, x++);
    } else if (r - l == 6) {
      Do32(u, l, x++);
      Do32(u, l + 2, x++);
      Do32(u, l + 4, x++);
      Do32(u + 3, l, x++);
      Do32(u + 3, l + 2, x++);
      Do32(u + 3, l + 4, x++);
    } else if (r - l == 7) {
      Do32(u, l, x++);
      Do32(u, l + 2, x++);
      Do23(u + 3, l, x++);
      Do23(u + 5, l, x++);
      Do23(u, l + 4, x++);
      Do23(u + 2, l + 4, x++);
      Do32(u + 4, l + 3, x++);
      Do32(u + 4, l + 5, x++);
    } else {
      x = solve(u, u + 6, l, l + 6, x);
      x = solve(u + 6, d, l + 6, r, x);
      x = solve(u, u + 6, l + 6, r, x);
      x = solve(u + 6, d, l, l + 6, x);
    }
  } else if (r - l == 6) {
    assert(d - u > 1);
    if ((d - u) % 2 == 1) {
      for (int i = u; i < d - 3; i += 2) {
        Do23(i, l, x++);
        Do23(i, l + 3, x++);
      }
      Do32(d - 3, l, x++);
      Do32(d - 3, l + 2, x++);
      Do32(d - 3, l + 4, x++);
    } else {
      for (int i = u; i < d; i += 2) {
        Do23(i, l, x++);
        Do23(i, l + 3, x++);
      }
    }
  } else if (d - u == 6) {
    assert(r - l > 1);
    if ((r - l)  % 2 == 1) {
      for (int i = l ; i < r - 3; i += 2) {
        Do32(u, i, x++);
        Do32(u + 3, i, x++);
      }
      Do23(u, r - 3, x++);
      Do23(u + 2, r - 3, x++);
      Do23(u + 4, r - 3, x++);
    } else {
      for (int i = l; i < r; i += 2) {
        Do32(u, i, x++);
        Do32(u + 3, i, x++);
      }
    }
  } else {
    assert(false);
  }
  return x;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i <= n; ++i)
      for (int j = 0; j <= n; ++j)
        a[i][j] = 0;
    solve(0, n + 1, 0, n + 1, 1);
    //for (int i = 0; i <= n; ++i)
    //  for (int j = 0; j <= n; ++j)
    //    cout << setw(2) << a[i][j] << " \n"[j == n];
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        bool same = a[i][j] != 0;
        for (int dx = 0; dx < 2; ++dx) {
          for (int dy = 0; dy < 2; ++dy) {
            same &= a[i + dx][j + dy] == a[i][j];
          }
        }
        if (same)
          cout << "#";
        else
          cout << ".";
      }
      cout << '\n';
    }
  }
  return 0;
}