Occult Square

A magic square is a square array of non-negative integers in which the sums of the numbers in each row, each column, and both main diagonals are equal. An $N \times N$ occult square is a magic square with $N$ rows and $N$ columns that also satisfies these conditions:

• Every integer in the square is between 0 and $N$, inclusive.
• For each $1 \le i \le N$, the number $i$ appears at most $i$ times in the square.
• The square contains at least two distinct positive integers.

For example, the following is a 5 × 5 occult square. The sums of each row, each column, and both main diagonals are 7.

0 0 0 3 4
2 4 0 0 1
0 0 3 4 0
5 0 0 0 2
0 3 4 0 0

For a given prime $P$, construct a $P \times P$ occult square, or determine that none exists.

The input contains one prime number $P$ ($2 \le P \le 1000$), the number of rows and columns of the occult square.

If no $P \times P$ occult square exists, print -1 on a line by itself. Otherwise, print $P$ lines with $P$ integers each. The $j$th integer on the $i$th line is the number in row $i$, column $j$ of the square. Any valid $P \times P$ occult square is accepted.