Not Adjacent Matrix

题意翻译

构造一个 $n*n$ 的矩阵，使得相邻的两个格子填的数不能相邻。 ### 输入 输入包含多组数据。第一行一个正整数 $t$，表示数据组数。 接下来 $t$ 行，每行一个正整数，表示每组数据的 $n$。 ### 输出 输出这个矩阵，如无解输出$-1$。

题目描述

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.

输入输出格式

输入格式

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 $ ).

输出格式

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

3
1
2
3

输出样例 #1

1
-1
2 9 7
4 6 3
1 8 5