#include <iostream>
#include <algorithm>
using namespace std;

char A[100][100];

int main() {
    int D; cin >> D;
    while(D--) {
        int N; cin >> N;
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < N; j++) {
                A[i][j] = ' ';
            }
        }
        int x = 0, y = N;
        const int dx[] = { 0, 1, 0, -1 };
        const int dy[] = { -1, 0, 1, 0 };
        int dir = 0;
        for(int i = 0; i < N; i++) {
            int k;
            if(i == 0) k = N;
            else k = N + 1 - (i + 1) / 2 * 2;

            for(int j = 0; j < k; j++) {
                x += dx[dir]; y += dy[dir];
                A[y][x] = '#';
            }
            (dir += 1) %= 4;
        }
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < N; j++) {
                cout << A[i][j];
            }
            cout << endl;
        }
        if(D != 0) cout << endl;
    }
}
### Prompt

Create a solution in cpp for the following problem:

I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.

* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates clockwise with the lower left corner as the base point.
* The part with a line is represented by # (half-width sharp), and the blank part is represented by "" (half-width blank).
* Leave a space between the lines.



Create a program that takes an integer n as an input and outputs a "round and round pattern" with a side length of n.



Input

The input is given in the following format:


d
n1
n2
::
nd


The number of datasets d (d ≤ 20) is given to the first line, and the side length ni (1 ≤ ni ≤ 100) of the i-th round pattern is given to each of the following d lines.

Output

Please output a round and round pattern for each data set. Insert a blank line between the datasets.

Example

Input

2
5
6


Output

#####
#   #
# # #
# # #
# ###

######
#    #
# ## #
# #  #
# #  #
# ####

### Response

```cpp
#include <iostream>
#include <algorithm>
using namespace std;

char A[100][100];

int main() {
    int D; cin >> D;
    while(D--) {
        int N; cin >> N;
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < N; j++) {
                A[i][j] = ' ';
            }
        }
        int x = 0, y = N;
        const int dx[] = { 0, 1, 0, -1 };
        const int dy[] = { -1, 0, 1, 0 };
        int dir = 0;
        for(int i = 0; i < N; i++) {
            int k;
            if(i == 0) k = N;
            else k = N + 1 - (i + 1) / 2 * 2;

            for(int j = 0; j < k; j++) {
                x += dx[dir]; y += dy[dir];
                A[y][x] = '#';
            }
            (dir += 1) %= 4;
        }
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < N; j++) {
                cout << A[i][j];
            }
            cout << endl;
        }
        if(D != 0) cout << endl;
    }
}
```