CF1520C.Not Adjacent Matrix

We will consider the numbers $a$ and $b$ as adjacent if they differ by exactly one, that is, $|a-b|=1$.

We will consider cells of a square matrix $n \times n$ as adjacent if they have a common side, that is, for cell $(r, c)$ cells $(r, c-1)$, $(r, c+1)$, $(r-1, c)$ and $(r+1, c)$ are adjacent to it.

For a given number $n$, construct a square matrix $n \times n$ such that:

• Each integer from $1$ to $n^2$ occurs in this matrix exactly once;
• If $(r_1, c_1)$ and $(r_2, c_2)$ are adjacent cells, then the numbers written in them must not be adjacent.

我们将称两个数 $a$ 和 $b$ 是相邻的，如果它们的差的绝对值恰好为 $1$，即 $|a-b|=1$。

我们将称一个 $n \times n$ 方阵中的两个格子是相邻的，如果它们有一条公共边，即：对于格子 $(r, c)$，与其相邻的格子为 $(r, c-1)$、$(r, c+1)$、$(r-1, c)$ 和 $(r+1, c)$。

对给定的正整数 $n$，请构造一个 $n \times n$ 的方阵，满足：

• $1$ 到 $n^2$ 中的每个整数在该矩阵中恰好出现一次；
• 若 $(r_1, c_1)$ 与 $(r_2, c_2)$ 是相邻的格子，则它们所填的数不能相邻。

The first line contains one integer $t$ ($1 \le t \le 100$). Then $t$ test cases follow.

Each test case is characterized by one integer $n$ ($1 \le n \le 100$).

第一行包含一个整数 $t$（$1 \le t \le 100$）。随后是 $t$ 个测试用例。

每个测试用例由一个整数 $n$（$1 \le n \le 100$）表征。

For each test case, output:

• -1, if the required matrix does not exist;
• the required matrix, otherwise (any such matrix if many of them exist).

The matrix should be outputted as $n$ lines, where each line contains $n$ integers.

对于每个测试用例，输出：

• -1，如果所要求的矩阵不存在；
• 否则输出所要求的矩阵（若存在多个满足条件的矩阵，输出任意一个即可）。

矩阵应以 $n$ 行形式输出，其中每行包含 $n$ 个整数。