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

const int N = 110;
int T, n;
char mp[N][N];

void SOLVE(int x, int xx, int y, int yy){
	if (x > xx)
		return;
	
	for (int i = x; i <= xx - 3; i += 2)
		mp[i][y] = mp[i][y + 1] = '#';
	for (int i = y; i <= yy - 3; i += 2)
		mp[xx][i] = mp[xx - 1][i] = '#';
	
	for (int i = xx; i >= x + 3; i -= 2)
		mp[i][yy] = mp[i][yy - 1] = '#';
	for (int i = yy; i >= y + 3; i -= 2)
		mp[x][i] = mp[x + 1][i] = '#';
	
	SOLVE(x + 3, xx - 3, y + 3, yy - 3);
}

void Solve(){
	cin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			mp[i][j] = '.';
	
	if (n == 4){
		cout << "##.#" << endl;
		cout << "...#" << endl;
		cout << "#..." << endl;
		cout << "#.##" << endl;
		return;
	}else if (n & 1){
		for (int i = 1; i <= n; i += 2)
			for (int j = 1; j + 1 <= n; j += 3)
				mp[i][j] = mp[i][j + 1] = '#';
		
		if (!(n % 3)){
			for (int i = 1; i <= n; i++)
				for (int j = n - 2; j <= n; j++)
					mp[i][j] = '.';
			
			for (int i = 1; i + 1 <= n; i += 3)
				mp[i][n - 2] = mp[i][n] = mp[i + 1][n - 2] = mp[i + 1][n] = '#';
		}else if (n % 3 == 1){
			for (int i = 1; i + 1 <= n; i += 3)
				mp[i][n] = mp[i + 1][n] = '#';
		}
	}else if (!(n % 6))
		SOLVE(1, n, 1, n);
	else{
		for (int i = 1; i <= n - 3; i += 2)
			for (int j = 1; j + 1 <= n; j += 3)
				mp[i][j] = mp[i][j + 1] = '#';
		
		for (int i = 1; i <= n; i += 2)
			mp[n][i] = mp[n - 1][i] = '#';
		
		if (n % 3 == 1){
			for (int i = 1; i + 1 <= n - 2; i += 3)
				mp[i][n] = mp[i + 1][n] = '#';
			
			mp[n - 1][n - 1] = '.';
			mp[n][n - 1] = mp[n][n] = '#';
		}
	}
	
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= n; j++)
			cout << mp[i][j] ;
		cout << endl;
	}
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> T;
    
    while (T--)
    	Solve();
	
    return 0;
}