Problem: Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!

Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines up and down, left and right, as many squares as it wants. And when it wants, it can stop. The queen walks in all directions vertically and diagonally at any distance. You can see the examples below.

<image>

To reach the goal, Egor should research the next topic:

There is an N × N board. Each cell of the board has a number from 1 to N ^ 2 in it and numbers in all cells are distinct.

In the beginning, some chess figure stands in the cell with the number 1. Note that this cell is already considered as visited. After that every move is determined by the following rules: 

  1. Among all not visited yet cells to which the figure can get in one move, it goes to the cell that has minimal number.
  2. If all accessible cells were already visited and some cells are not yet visited, then the figure is teleported to the not visited cell that has minimal number. If this step happens, the piece pays a fee of 1 vun.
  3. If all cells are already visited, the process is stopped. 



Egor should find an N × N board on which the rook pays strictly less vuns than the queen during the round with this numbering. Help him to find such N × N numbered board, or tell that it doesn't exist.

Input

The only line contains one integer N — the size of the board, 1≤ N ≤ 500.

Output

The output should contain N lines.

In i-th line output N numbers — numbers on the i-th row of the board. All numbers from 1 to N × N must be used exactly once.

On your board rook must pay strictly less vuns than the queen.

If there are no solutions, print -1.

If there are several solutions, you can output any of them. 

Examples

Input


1


Output


-1

Input


4


Output


4 3 6 12 
7 5 9 15 
14 1 11 10 
13 8 16 2 

Note

In case we have 1 × 1 board, both rook and queen do not have a chance to pay fees.

In second sample rook goes through cells 1 → 3 → 4 → 6 → 9 → 5 → 7 → 13 → 2 → 8 → 16 → 11 → 10 → 12 → 15 → (1 vun) → 14. 

Queen goes through 1 → 3 → 4 → 2 → 5 → 6 → 9 → 7 → 13 → 8 → 11 → 10 → 12 → 15 → (1 vun) → 14 → (1 vun) → 16.

As a result rook pays 1 vun and queen pays 2 vuns.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class E1333 {

	static boolean done = false;
	static int[][] sol = {{1,2,4},{5,3,8},{9,6,7}};

	public static void main(String[] args){
		JS scan = new JS();
		PrintWriter out = new PrintWriter(System.out);
		int n = scan.nextInt();
		if(n <= 2){
			System.out.println(-1);
			return;
		}
		int[][] ans = new int[n][n];
		int num = 1;
		for(int col = n-1; col >= 0; col--){
			int high = n-1;
			if(col <= 2) high = n-4;
			if(col % 2 == 1){
				for(int row = high; row >= 0; row--){
					ans[row][col] = num;
					num++;
				}
			}
			else{
				for(int row = 0; row <= high; row++){
					ans[row][col] = num;
					num++;
				}
			}
		}
		for(int i = n-3; i < n; i++){
			for(int j = 0; j < 3; j++){
				ans[i][j] = sol[i-(n-3)][j]+num-1;
			}
		}
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				out.print(ans[i][j]+" ");
			}
			out.println();
		}
		out.flush();
	}

	static int simQueen(int[][] ans){
		int n = ans.length;
		boolean[][] v = new boolean[n][n];
		Pair curr = null;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				if(ans[i][j] == 0){
					curr = new Pair(i, j);
					v[i][j] = true;
				}
			}
		}
		int res = 0;
		int[] dx = {1, 0, -1, 0, 1, 1, -1, -1};
		int[] dy = {0, 1, 0, -1, 1, -1, 1, -1};

		for(int i = 0; i < 8; i++){
			Pair next = null;
			int min = Integer.MAX_VALUE;
			for(int k = 0; k < dx.length; k++){
				int nr = curr.a;
				int nc = curr.b;
				for(int j = 0; j < n; j++){
					nr += dx[k];
					nc += dy[k];
					if(nr < n && nc < n && nr >= 0 && nc >= 0){
						if(!v[nr][nc]){
							if(ans[nr][nc] < min){
								min = ans[nr][nc];
								next = new Pair(nr, nc);
							}
						}
					}
				}
			}
			if(next == null){
				res++;
				for(int k = 0; k < n; k++){
					for(int l = 0; l < n; l++){
						if(!v[k][l]){
							if(ans[k][l] < min){
								next = new Pair(k, l);
								min = ans[k][l];
							}
						}
					}
				}
			}
			curr = next;
			v[curr.a][curr.b] = true;
		}
		return res;
	}

	static int simRook(int[][] ans){
		int n = ans.length;
		boolean[][] v = new boolean[n][n];
		Pair curr = null;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				if(ans[i][j] == 0){
					curr = new Pair(i, j);
					v[i][j] = true;
				}
			}
		}
		int res = 0;
		int[] dx = {1, 0, -1, 0};
		int[] dy = {0, 1, 0, -1};

		for(int i = 0; i < 8; i++){
			Pair next = null;
			int min = Integer.MAX_VALUE;
			for(int k = 0; k < dx.length; k++){
				int nr = curr.a;
				int nc = curr.b;
				for(int j = 0; j < n; j++){
					nr += dx[k];
					nc += dy[k];
					if(nr < n && nc < n && nr >= 0 && nc >= 0){
						if(!v[nr][nc]){
							if(ans[nr][nc] < min){
								min = ans[nr][nc];
								next = new Pair(nr, nc);
							}
						}
					}
				}
			}
			if(next == null){
				res++;
				for(int k = 0; k < n; k++){
					for(int l = 0; l < n; l++){
						if(!v[k][l]){
							if(ans[k][l] < min){
								next = new Pair(k, l);
								min = ans[k][l];
							}
						}
					}
				}
			}
			curr = next;
			v[curr.a][curr.b] = true;
		}
		return res;
	}

	static void permute(int[] perm, boolean[] u, int v){
		if(done) return;
		if(v == perm.length){
			int n = 3;
			int[][] ans = new int[n][n];
			for(int i = 0; i < 3*n; i++)
				ans[i/3][i%3] = perm[i];
			
			int a = simQueen(ans);
			int b = simRook(ans);
			if(b < a){
				System.out.println(a+" "+b);
				for(int i = 0; i < n; i++){
					System.out.println(Arrays.toString(ans[i]));
				}
				done = true;
				return;
			}
		}
		for(int i = 0; i < perm.length; i++){
			if(!u[i]){
				perm[v] = i;
				u[i] = true;
				permute(perm, u, v+1);
				u[i] = false;
			}
		}
	}

	static class Pair{

		int a;
		int b;

		public Pair(int a, int b){
			this.a = a;
			this.b = b;
		}
	}

	static class JS{
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;
 
		public JS() {
			in = new BufferedInputStream(System.in, BS);
		}
 
		public JS(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}
 
		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}				
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}
 
		public int nextInt() {
			return (int)nextLong();
		}
 
		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}
 
		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}
 
		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
 
		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
 
		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
	}
}