#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

inline void work() {
	int n; cin >> n;
	vector<vector<bool>> s(n + 1, vector<bool>(n + 1, false));
	if (n % 3 == 0 || n % 3 == 2) {
		if (n & 1) {
			rep(i, 1, n) {
				if (i % 3 == 0) continue;
			 	rep(j, 1, n) s[i][j] = (j & 1);
			}
		} else {
			rep(i, 1, n) {
				if (i & 1) s[i][n - 1] = s[i][n] = true;
				if (i % 3 == 0) continue;
				rep(j, 1, n - 3) s[i][j] = (j & 1);
			}
		}
	} else if (n != 1) {
		int m = n; n -= 4;
		if (n & 1) {
			rep(i, 1, n) {
				if (i % 3 == 0) continue;
			 	rep(j, 1, n) s[i + 2][j + 2] = (j & 1);
			}
		} else {
			rep(i, 1, n) {
				if (i & 1) s[i + 2][n + 1] = s[i + 2][n + 2] = true;
				if (i % 3 == 0) continue;
				rep(j, 1, n - 3) s[i + 2][j + 2] = (j & 1);
			}
		}
		rep(i, 1, m) {
			if (i % 3 != 0) s[1][i] = s[i][m] = true;
			if (i % 3 != 2) s[i][1] = true;
		}
		s[m][m - 1] = true;
		rep(i, 3, m - 3) if (i & 1) s[m - 1][i] = s[m][i] = true;
		n = m;
	}
	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;
}