/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 109, mod = 998244353;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
int n, px, py, ans, pos;
bool mp[N][N]; 
inline void solve() 
{
	n = read(), ans = 0; 
	L(i, 1, n) 
		L(j, 1, n) mp[i][j] = 0; 
	px = (n + 1) / 2, py = (n + 1) / 3; 
	
	L(i, 0, (n + 1) / 2) 
	{
		int tx = i, ty = (n + 1 - i * 2) / 3; 
	//	cout << px << " " << py << " " << tx << " " << ty << endl; 
		if(tx * py + ty * px > ans) ans = tx * py + ty * px, pos = i; 
	}
	int nw = 1; 
	L(i, 1, pos) 
	{
		for (int j = 1; j < n; j += 3) mp[nw][j] = mp[nw][j + 1] = 1;
		nw += 2;  
	}
	L(i, 1, (n + 1 - pos * 2) / 3) 
	{
		for (int j = 1; j <= n; j += 2) mp[nw][j] = mp[nw + 1][j] = 1; 
		nw += 3; 
	}
	L(i, 1, n) 
	{
		L(j, 1, n) 
		{
			if(!mp[i][j]) putchar('.');
			else putchar('#'); 
		}
		puts("");
	}
	return ;
}
signed main()
{
	int T; 
	T = read();
	L(i, 1, T) solve(); 
	return 0;
}