#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef vector<int> vi;
typedef pair<int,int> pi;

vector< vector<string> > sq(7), rec(7);
void init(){
	sq[1]={
		"."
		};
	sq[2]={
		"##",
		".."
		};
	sq[3]={
		"##.",
		"...",
		"##."
		};
	sq[4]={
		"##.#",
		"...#",
		"#...",
		"#.##"
	};
	sq[5]={
		"##.##",
		".....",
		"##.##",
		".....",
		"##.##"
	};
	sq[6]={
		"##.#.#",
		"...#.#",
		"##....",
		"....##",
		"#.#...",
		"#.#.##"
	};
	
	rec[1]={
		"##.##."
	};
	rec[2]={
		"#.#.#.",
		"#.#.#."
	};
	rec[3]={
		"##.##.",
		"......",
		"##.##."
	};
	rec[4]={
		"##.##.",
		"......",
		"#.#.#.",
		"#.#.#."
	};
	rec[5]={
		"##.##.",
		"......",
		"##.##.",
		"......",
		"##.##."
	};
}
void solve(){
	int n; cin>>n;
	vector<vector<bool>> ans(n, vector<bool>(n));
	auto write0=[&](int x,int y){
		rep(i,0,5){
			rep(j,0,5){
				ans[x+i][y+j]=(j%3<=1 && i%2==0);
			}
		}
	};
	auto write1=[&](int x,int y,int a,int b){
		if(a==b){
			rep(i,0,a-1){
				rep(j,0,b-1){
					ans[x+i][y+j]=(sq[a][i][j]=='#');
				}
			}
		}
		else{
			if(a==6){
				rep(i,0,a-1){
					rep(j,0,b-1){
						ans[x+i][y+j]=(rec[b][j][i]=='#');
					}
				}
			}
			if(b==6){
				rep(i,0,a-1){
					rep(j,0,b-1){
						ans[x+i][y+j]=(rec[a][i][j]=='#');
					}
				}
			}
		}
	};
	rep(i,1,n/6){
		rep(j,1,n/6){
			write0((i-1)*6, (j-1)*6);
		}
	}
	rep(i,1,n/6){
		write1((i-1)*6, n/6*6, 6, n%6);
		write1(n/6*6, (i-1)*6, n%6, 6);
	}
	int r=(n-1)%6+1;
	write1(n-r, n-r, r, r);
	rep(i,0,n-1){
		rep(j,0,n-1){
			cout<<(ans[i][j]? "#": ".");
		}
		cout<<'\n';
	}
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	init();
	int t; cin>>t;
	while(t--){
		solve();
	}
}