Codeforces 710C. Magic Odd Square n阶幻方

C. Magic Odd Square

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

Find an n × n matrix with different numbers from 1 to n², 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 n². 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
题目连接：http://codeforces.com/problemset/problem/710/C

---

题意：n*n的矩阵内填入1~n*n使得行，列，对角线的和为奇数（n为奇数）。
思路：n阶幻方（行，列，对角线的和相等）也符合这种情况。
传送门：n阶幻方代码：

 #include<iostream>
 #include<cstdio>
 using namespace std;
 int x[][];
 int main()
 {
     int n;
     scanf("%d",&n);
     int i=,j=n/,num=;
     while(num<=n*n)
     {
         int ii=(i%n+n)%n;
         int jj=(j%n+n)%n;
         x[ii][jj]=num;
         if(num%n==) i++;
         else --i,j++;
         num++;
     }
     for(i=;i<n;i++)
     {
         for(j=;j<n;j++)
             cout<<x[i][j]<<" ";
         cout<<endl;
     }
     return ;
 }

n为奇数