#include <bits/stdc++.h>
#define rep(i, min, max) for(int i = (min); i <= (max); ++i)
#define nrep(i, max, min) for(int i = (max); i >= (min); --i)
#define reads(str) (scanf("%s", str + 1), strlen(str + 1))
#define case() int Ts = read(); rep(T, 1, Ts)
#define putf(flag) puts((flag) ? "Yes" : "No")
#define put(x) printf("%d ", x)
#define putl(x) printf("%lld ", x)
#define endl() putchar('\n')
using namespace std;

void print() { cerr << endl; }
template<typename T, typename ...Ts>
void print(T x, Ts ...xs) { cerr << x << " "; print(xs...); }

typedef long long ll;
inline ll read()
{
    ll now=0; bool nev=false; char c=getchar();
    while(c<'0' || c>'9') { if(c=='-') nev=true; c=getchar(); }
    while(c>='0' && c<='9') { now=(now<<1)+(now<<3)+(c&15); c=getchar(); }
    return nev?-now:now;
}

const int N = 200 + 10;

int a[N][N];

int main() {
    case() {
        int n = read(), n0 = n, ax = 0, ay = 0;
        rep(i, 1, n) rep(j, 1, n) a[i][j] = 0;
        while(n > 1 && n % 3 == 1) {
            rep(i, 1, n - 1) if(i % 3 != 0) {
                a[1 + ax][i + ay] = a[i + ax][n + ay] = a[n + ax][n - i + 1 + ay] = a[n - i + 1 + ax][1 + ay] = 1;
            }
            ax += 2, ay += 2;
            n -= 4;
        }
        int xlim = n, ylim = n;
        while((xlim + 1) % 3 != 0) xlim --;
        while((ylim + 1) % 2 != 0) ylim --;
        rep(i, 1, n) {
            rep(j, 1, n) {
                if(j % 2 != 0 && i % 3 != 0 && i <= xlim && j <= ylim) {
                    a[i + ax][j + ay] = 1;
                }
            }
        }
        if(n % 3 == 1) rep(i, 1, xlim) if(i % 3 != 0) a[n + ax][i + ay] = 1;
        n = n0;
        rep(i, 1, n) {
            rep(j, 1, n) {
                if(a[i][j]) putchar('#');
                else putchar('.');
            }
            putchar('\n');
        }
            // putchar('\n');
    }
}