Codeforces 710C-Magic Odd Square

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 from1 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

解：魔方矩阵的变形，输入一个奇数n，形成一个n*n的矩阵，使得矩阵的每一行，每一列，两个对角线都是奇数。

因为输入为奇数，所以直接利用魔方矩阵的思路做就可以了。

#include <stdio.h>
#include <stdlib.h>

void CalculateOddMagicSquare(int n)
{
  int matrix[50][50];

  int nsqr = n * n;
  int i=0, j=n/2;    

  for (int k=1; k<=nsqr; ++k) 
  {
    matrix[i][j] = k;

    i--;
    j++;

    if (k%n == 0) 
    { 
      i += 2; 
      --j; 
    }
    else 
    {
      if (j==n) 
        j -= n;
      else if (i<0) 
        i += n;
    }
  }
  for(int i=0;i<n;i++){
  	for(int j=0;j<n-1;j++){
  		printf("%d ",matrix[i][j]);
  	}
  	printf("%d\n",matrix[i][n-1]);
  }
}
int main()
{
	int n;
	while(~scanf("%d",&n)){
		CalculateOddMagicSquare(n);
	}
	return 0;
}