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

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=105,mod=1000000007;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return 1ll*x*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x); return res;}

int n;
char a[N][N];

void solve(int x, int y, int m1, int m2){
    if(m1%2==0&&m2%3==0){
        for(int i=x; i<x+m1; i+=2) for(int j=y; j<y+m2; j+=3) a[i][j]=a[i][j+1]='#';
    }
    else if(m1%3==0&&m2%2==0){
        for(int i=x; i<x+m1; i+=3) for(int j=y; j<y+m2; j+=2) a[i][j]=a[i+1][j]='#';
    }
}

void ahcorz(){
    cin >> n;
    n++;
    for(int i=0; i<n; ++i) for(int j=0; j<n; ++j) a[i][j]='.';
    if(n%6==0){
        solve(0,0,n,n);
    }
    else if(n%6==3){
        solve(0,0,n-3,n);
        solve(n-3,0,3,n-1);
    }
    else if(n%6==1){
        solve(0,0,n-3,n-4);
        solve(0,n-4,n-4,4);
        solve(n-3,0,3,n-3);
        solve(n-4,n-3,4,3);
    }
    else if(n%6==5){
        solve(0,0,n-2,n-3);
        solve(0,n-3,n-3,3);
        solve(n-2,0,2,n-2);
        solve(n-3,n-2,3,2);
    }
    else if(n%6==2){
        solve(0,0,n-2,n);
        solve(n-2,0,2,n-2);
    }
    else if(n%6==4){
        solve(0,0,n-4,n);
        solve(n-4,0,4,n-1);
    }
    for(int i=0; i<n-1; ++i){
        for(int j=0; j<n-1; ++j) cout << a[i][j];
        cout << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t; cin >> t;
    while(t--){
        ahcorz();
    }
}