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

#define pb push_back
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

#define N 107

bool s[N][N];

void dfs(int l, int x, int y) {
	if (l <= 5) {
		if (l == 2) s[x][y] = s[x][y + 1] = true; 
		if (l == 3) {
			s[x][y] = s[x][y + 1] = true;
			s[x + 2][y] = s[x + 2][y + 1] = true;
		}
		if (l == 4) {
			s[x][y] = s[x][y + 1] = true;
			s[x][y + 3] = s[x + 1][y + 3] = true;
			s[x + 3][y + 3] = s[x + 3][y + 2] = true;
			s[x + 3][y] = s[x + 2][y] = true;
		}
		if (l == 5) {
			rep(i, 0, 4) rep(j, 0, 4) 
				if (j % 2 == 0 && i % 3 != 2) s[x + i][y + j] = true;
		}
		return;
	}
	if (l % 3 == 0) {
		rep(i, 0, l - 4) if (i % 3 != 2) {
			s[x][y + i] = s[x + 2][y + i] = true;
			s[x + i][y + l - 1] = s[x + i][y + l - 3] = true;
			s[x + l - 1][y + l - 1 - i] = s[x + l - 3][y + l - 1 - i] = true; 
			s[x + l - 1 - i][y] = s[x + l - 1 - i][y + 2] = true;
		}
		dfs(l - 8, x + 4, y + 4); 
	} else if (l % 3 == 1) {
		rep(i, 0, l - 2) if (i % 3 != 2) {
			s[x][y + i] = true;
			s[x + i][y + l - 1] = true;
			s[x + l - 1][y + l - 1 - i] = true; 
			s[x + l - 1 - i][y] = true;
		}
		dfs(l - 4, x + 2, y + 2); 
	} else {
		rep(i, 0, l - 6) if (i % 3 != 2) {
			s[x][y + i] = s[x + 2][y + i] = s[x + 4][y + i] = true;
			s[x + i][y + l - 1] = s[x + i][y + l - 3] = s[x + i][y + l - 5] = true;
			s[x + l - 1][y + l - 1 - i] = s[x + l - 3][y + l - 1 - i] = s[x + l - 5][y + l - 1 - i] = true; 
			s[x + l - 1 - i][y] = s[x + l - 1 - i][y + 2] = s[x + l - 1 - i][y + 4] = true;
		}
		if (l == 8) dfs(2, x + 3, y + 3);
		else dfs(l - 12, x + 6, y + 6);
	}
}

inline void work() {
	int n; cin >> n;
	rep(i, 1, n) rep(j, 1, n) s[i][j] = false;
	dfs(n, 1, 1);
	rep(i, 1, n) {
		rep(j, 1, n) putchar(s[i][j] ? '#' : '.');
		puts("");
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int t; cin >> t;
	while (t--) work();
	return 0;
}