#include<bits/stdc++.h>
using namespace std;
template<typename G> inline void read(G&x) {x=0;G f=1;char ch=getchar();while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();if(ch=='-') f=-1,ch=getchar();while(ch>='0'&&ch<='9') {x=x*10+(ch^48);ch=getchar();}x*=f;}
const int MAXN=100+5;
bool ans[MAXN][MAXN];
void sol(int x,int y) {
	if(x>y) return;
	int n=y-x+1;
	if(n%6==5) {
		for(int i=x;i<=y;i+=2) {
			for(int j=x;j<=y;j+=3) {
				ans[i][j]=ans[i][j+1]=1;
			}
		}return;
	}
	if(n%6==2) {
		for(int i=x;i<=y-3;i+=2) {
			for(int j=x;j<=y;j+=3) {
				ans[i][j]=ans[i][j+1]=1;
			}
		}
		for(int j=x;j<=y;j+=2) {
			ans[n-1][j]=ans[n][j]=1;
		}return;
	}
	if(n==3) {
		ans[x][x]=ans[x][x+1]=ans[y][x]=ans[y][x+1]=1;
		return;
	}
	if(n%3==0) {
		for(int i=0;i<=n-4;i+=3) {
			ans[x][x+i]=ans[x+2][x+i]=ans[x][x+i+1]=ans[x+2][x+i+1]=1;
			ans[x+i][y]=ans[x+i][y-2]=ans[x+i+1][y]=ans[x+i+1][y-2]=1;
			ans[y][y-i]=ans[y-2][y-i]=ans[y][y-i-1]=ans[y-2][y-i-1]=1;
			ans[y-i][x]=ans[y-i][x+2]=ans[y-i-1][x]=ans[y-i-1][x+2]=1;
		}
		sol(x+4,y-4);
	}
	if(n%3==1) {
		for(int i=0;i<=n-4;i+=3) {
			ans[x][x+i]=ans[x][x+i+1]=1;
			ans[x+i][y]=ans[x+i+1][y]=1;
			ans[y][y-i]=ans[y][y-i-1]=1;
			ans[y-i][x]=ans[y-i-1][x]=1;
		}
		sol(x+2,y-2);
	}
}
int T,n;
signed main() {
	#ifndef ONLINE_JUDGE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
	#endif
	double st=clock();
	read(T);
	while(T--) {
		read(n);
		memset(ans,0,sizeof(ans));
		sol(1,n);
		for(int i=1;i<=n;++i) {
			for(int j=1;j<=n;++j) {
				if(ans[i][j]) putchar('#');
				else putchar('.');
			}putchar('\n');
		}
	}
	double ed=clock();
	cerr<<(ed-st)/CLOCKS_PER_SEC;
	return 0; 
}