import java.io.*;
import java.util.*;
public class prosjecni {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
if(n == 2) {
System.out.println(-1);
return;
}
int[][] arr = new int[n][n];
int last = 0;
for(int i = 0; i < n - 1; i++) {
arr[i][0] = last + 1;
long soFar = arr[i][0];
for(int j = 1; j < n - 1; j++) {
arr[i][j] = arr[i][j-1]+1;
soFar += arr[i][j];
}
arr[i][n-1] = (int) ((arr[i][n/2] * (n)) - soFar);
last = arr[i][n-1];
}
long cols = 0;
for(int i = 0; i < n; i++) cols += arr[i][0];
arr[n-1][0] = (int) ((arr[n/2][0] * (n)) - cols);
for(int i = 1; i < n; i++) {
arr[n-1][i] = arr[n-1][i-1] + 1;
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
