Problem: Find an n × n matrix with different numbers from 1 to n2, so the sum in each row, column and both main diagonals are odd.

Input

The only line contains odd integer n (1 ≤ n ≤ 49).

Output

Print n lines with n integers. All the integers should be different and from 1 to n2. The sum in each row, column and both main diagonals should be odd.

Examples

Input

1


Output

1


Input

3


Output

2 1 4
3 5 7
6 9 8

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Solution {
	
//	public static final double eps = 1e-9;
//	public static final int mod = 1000000007;
//	public static final double pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;
//	public static final int sievesize = (int) (1e6 + 10);
//	public static boolean[] prime;
//	public static final int dx[] = {1, -1, 0, 0};
//	public static final int dy[] = {0, 0, 1, -1};

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
	}
	
	static class Task {
				
        public void solve(int testNumber, InputReader in, OutputWriter out) { 
        	int n = in.nextInt();
        	long[][] arr = new long[n][n];
        	for(int i = 0; i < n; i++)
        	{
        		for(int j = 0; j < n; j++)
        		{
        			arr[i][j] = n * ((i + 1 + j + 1 - 1 + n/2) % n) + ((i + 1 + 2*(j + 1) - 2) % n) + 1;
        			out.print(arr[i][j]);
        		}
        		out.pw.println();
        	}
        }
        
//        static class Node {
//        	LinkedList<Pair> list;
//        	boolean storage;
//        	
//        	public Node() {
//				list = new LinkedList<>();
//				storage = false;
//			}
//        }
        
//        static class Pair implements Comparable<Pair> {
//        	
//        	long first, second;
//        	
//        	public Pair(long first, long second) {
//        		this.first = first;
//				this.second = second;
//			}
//
//			@Override
//			public int compareTo(Pair o) {
//				return 0;
//			}	
//        }
    }

//	public static boolean triangle(long a, long b, long c){
//	    return ((a+b) > c && (b+c) >a && (a+c) > b);
//	}
//		
//	public static boolean isPerfectSquare(long n){
//		if (n < 0) 
//	    	return false;
//	    long test = (long) (Math.sqrt(n) + 0.5);
//	    return test*test == n;
//	}
//		
//	public static int isnum(char s){
//		if(s=='1' || s=='2' || s=='3' || s=='4' || s=='5' || s=='6' || s=='7' || s=='8' || s=='9' || s=='0') 
//	    	return 1; 
//		return 0;
//	}
//		
//	public static long nextPowerOf2(long n){
//	    n--;
//	    n |= n >> 1;
//	    n |= n >> 2;
//	    n |= n >> 4;
//	    n |= n >> 8;
//	    n |= n >> 16;
//	    n++;
//	    return n;
//	}
//		
//	public static long gcd(long a, long b){
//	    long t; 
//	    while (b > 0){ 
//	    	a = a%b; 
//	    	t = a; 
//	    	a = b; 
//	    	b = t; 
//    	}
//	    return a;
//	}
//		
//	public static void sieve(int n){
//		prime=new boolean[sievesize+1];
//	    long x, y; 
//	    prime[0] = prime[1] = true;
//	    for(x = 2; x * x <= sievesize; x++)
//	    { 
//	    	if(!prime[(int) x])
//	    		for(y = x * x; y <= sievesize; y += x) 
//	    			prime[(int) y]=true; 
//	    }
//	}
	
	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        
        public long nextLong() {
        	return Long.parseLong(next());
        }
        
        public int[] nextIntArray(int size) {
        	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        	int[] arr=new int[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = Integer.parseInt(tokenizer.nextToken());
        	return arr;
        }

        public long[] nextLongArray(int size) {
        	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        	long[] arr=new long[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = Long.parseLong(tokenizer.nextToken());
        	return arr;
        }
        
        public double[] nextDoubleArray(int size) {
        	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        	double[] arr=new double[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = Double.parseDouble(tokenizer.nextToken());
        	return arr;
        }
        
        public String[] nextStringArray(int size) throws IOException {
        	String[] arr=new String[size];
        	for(int i = 0; i < size; i++) 
        		arr[i] = reader.readLine();
        	return arr;
        }
        
        public char[] nextCharArray(int size) throws IOException {
        	char[] arr=reader.readLine().toCharArray();
        	return arr;
        }
    }
	
	static class OutputWriter {
		public PrintWriter pw;
		
		public OutputWriter(OutputStream stream) {
			pw = new PrintWriter(stream);
		}
		
		public void println(Object str) {
			pw.println(str);
		}
		
		public void print(Object str) {
			pw.print(str + " ");
		}
		
		public void close() {
			pw.close();
		}
		
		public void flush() {
			pw.flush();
		}
		
		public void printIntArray(int[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printLongArray(long[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printCharArray(char[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printFloatArray(float[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
		
		public void printDoubleArray(double[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
	}
}