Problem9114--ABC335 —— D - Loong and Takahashi

9114: ABC335 —— D - Loong and Takahashi

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

There is a grid with $N$ rows and $N$ columns, where $N$ is an odd number at most $45$.
Let $(i,j)$ denote the cell at the $i$\-th row from the top and $j$\-th column from the left.
In this grid, you will place Takahashi and a dragon consisting of $N^2-1$ parts numbered $1$ to $N^2-1$ in such a way that satisfies the following conditions:
-   Takahashi must be placed at the center of the grid, that is, in cell $(\frac{N+1}{2},\frac{N+1}{2})$.
-   Except for the cell where Takahashi is, exactly one dragon part must be placed in each cell.
-   For every integer $x$ satisfying $2 \leq x \leq N^2-1$, the dragon part $x$ must be placed in a cell adjacent by an edge to the cell containing part $x-1$.
    -   Cells $(i,j)$ and $(k,l)$ are said to be adjacent by an edge if and only if $|i-k|+|j-l|=1$.

Print one way to arrange the parts to satisfy the conditions. It is guaranteed that there is at least one arrangement that satisfies the conditions.

Input

The input is given from Standard Input in the following format:
```
$N$
```

Output

Print $N$ lines.  
The $i$\-th line should contain $X_{i,1},\ldots,X_{i,N}$ separated by spaces, where $X_{i,j}$ is `T` when placing Takahashi in cell $(i,j)$ and $x$ when placing part $x$ there.

Constraints

$3 \leq N \leq 45$
$N$ is odd.

Sample 1 Input

5

Sample 1 Output

1 2 3 4 5
16 17 18 19 6
15 24 T 20 7
14 23 22 21 8
13 12 11 10 9

HINT

相同题目:ABC335

Source/Category