#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 105
int a[N][N],n;
void push(int x,int y,int o)
{
	if(o==1) a[x][y]=a[x][y+1]=1;
	else a[x][y]=a[x+1][y]=1;
}
void solve(int n,int x,int y)
{
	if(n%2==0)
	{
		if(n%3==0)
		{
			for(int i=0;i<n;i+=3)
			{
				for(int j=0;j<n;j+=2) push(x+i,y+j,0);
			}
		}
		else if(n%3==1)
		{
			for(int i=0;i+4<n;i+=3)
			{
				for(int j=0;j<n;j+=2) push(x+i,y+j,0);
			}
			for(int j=0;j+2<n;j+=3) push(x+n-4,y+j,1),push(x+n-2,y+j,1);
		}
		else
		{
			for(int i=0;i+2<n;i+=3)
			{
				for(int j=0;j<n;j+=2) push(x+i,y+j,0);
			}
			for(int j=0;j+2<n;j+=3) push(x+n-2,y+j,1);
		}
		return ;
	}
	if(n==1) return ;
	if(n==3)
	{
		push(x,y,0);
		return ;
	}
	if(n==5)
	{
		push(x,y,0),push(x,y+2,1),push(x+3,y,1),push(x+2,y+3,0);
		return ;
	}
	for(int j=0;j+3<n;j+=2) push(x,y+j,0);
	for(int i=0;i+3<n;i+=2) push(x+i,y+n-3,1);
	for(int j=3;j<n;j+=2) push(x+n-3,y+j,0);
	for(int i=3;i<n;i+=2) push(x+i,y,1);
	solve(n-6,x+3,y+3);
}
void work()
{
	n=read();
	n++;
	memset(a,0,sizeof(a));
	solve(n,0,0);
	for(int i=0;i+1<n;i++)
	{
		for(int j=0;j+1<n;j++) printf("%c",".#"[a[i][j]]);
		cout<<"\n";
	}
}
signed main()
{
	int T=read(); while(T--) work();
	return 0;
}