#include

using namespace std;

int a[1000][1000];

int c;
int dire;
int x, y;
int n;
int i, j;

void move()
{
switch (dire)
{
case 0: //向右走
x++; return;

case 1:                            //向下走
    y++; return;

case 2:                            //向左走
    x--; return;

case 3:                            //向上走
    y--; return;

}
}

int main()
{
cin >> n; //输入n

x = (n - 1) / 2;
y = x;                                       //找出1的位置

c = 1;
a[y][x] = c;   
c++;

dire = 0;

move();                          //初始化完成

a[y][x] = c;                      //开始填充
c++;
dire = (dire + 1) % 4;     //用于改变方向，方向改变的顺序总是右下左上，分别是0123

for (i = 1; i < n; i++)
{
    for (j = 0; j < i; j++)
    {
        move();
        a[y][x] = c;
        c++;
    }
    dire = (dire + 1) % 4;                //第一次改变方向

    for (j = 0; j < i; j++)
    {
        move();
        a[y][x] = c;
        c++;
    }
    move();
    a[y][x] = c;
    c++;
    dire = (dire + 1) % 4;            //第二次改变方向
}
//输出结果
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
cout << a[i][j] << ' ';
}
cout << endl;
}

return 0;
}