#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vvvvvb = vector<vvvvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}
ll cnt = 0;
ll gcd(ll(a), ll(b)) {
    cnt++;
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;
}

bool DEB=0;
void solve(ll N){
    vvll A(N,vll(N,0));
    if(DEB)cout<<N<<endl;
    if(N%6==0){
        rep(i,N/3-1){
            rep(j,N/2-1){
                A[i*3][j*2]=A[i*3+1][j*2]=1;
            }
        }
        rep(j,N/3-1){
            A[N-1][j*3]=A[N-1][j*3+1]=1;
            A[N-3][j*3]=A[N-3][j*3+1]=1;
        }
        rep(i,N/2-1){
            A[2*i][N-2]=A[2*i][N-1]=1;
        }
        A[N-1][N-3]=A[N-2][N-3]=1;
        A[N-1][N-1]=A[N-2][N-1]=1;
        
    }
    else if(N%6==1){
        rep(i,N/3){
            rep(j,N/2+1){
                A[i*3][j*2]=A[i*3+1][j*2]=1;
            }
        }
        rep(j,N/3){
            A[N-1][j*3]=A[N-1][j*3+1]=1;
        }
    }
    else if(N%6==2){
        rep(i,N/3+1){
            rep(j,N/2-1){
                A[i*3][j*2]=A[i*3+1][j*2]=1;
            }
        }
        rep(i,N/2){
            A[i*2][N-1]=A[i*2][N-2]=1;
        }
    }
    else if(N%6==3){
        rep(i,N/3-1){
            rep(j,N/2+1){
                A[i*3][j*2]=A[i*3+1][j*2]=1;
            }
        }
        rep(j,N/3){
            A[N-1][j*3]=A[N-1][j*3+1]=1;
            A[N-3][j*3]=A[N-3][j*3+1]=1;
        }
    }
    else if(N%6==4){
        rep(i,N/3){
            rep(j,N/2-1){
                A[i*3][j*2]=A[i*3+1][j*2]=1;
            }
        }
        rep(i,N/2-1){
            A[i*2][N-2]=A[i*2][N-1]=1;
        }
        rep(j,N/3){
            A[N-1][j*3]=A[N-1][j*3+1]=1;
        }
        A[N-1][N-1]=A[N-2][N-1]=1;
    }
    else if(N%6==5){
        rep(i,N/3+1){
            rep(j,N/2+1){
                A[i*3][j*2]=A[i*3+1][j*2]=1;
            }
        }
    }

    rep(i,N){
        rep(j,N)cout<<(A[i][j]==0?'.':'#');
        cout<<endl;
    }
    if(DEB)cout<<endl;
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll T;
    cin>>T;
    rep(t,T){
        ll N;
        cin>>N;
        solve(N);
    }
}