#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<queue>

 #include<stack>

 #include<cmath>

 #include<algorithm>

 #include<malloc.h>

 using namespace std;

 #define clc(a,b) memset(a,b,sizeof(a))

 #define inf 0x3f3f3f3f

 const int N=;

 #define LL long long

 const double eps = 1e-;

 const double pi = acos(-);

  int g[][];

 // inline int r(){

 //     int x=0,f=1;char ch=getchar();

 //     while(ch>'9'||ch<'0'){if(ch=='-') f=-1;ch=getchar();}

 //     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

 //     return x*f;

 // }

 int n,x,y;

 int mp[][];

 int main()

 {

     scanf("%d",&n);

     x = ,y = (n+)/;

     mp[x][y]=;

     for(int i=;i<=n*n;i++)

     {

         if(x==&&y!=n)

             x=n,y++;

         else if(x!=&&y==n)

             x--,y=;

         else if(x==&&y==n)

             x++;

         else if(!mp[x-][y+])

             x--,y++;

         else

             x++;

         mp[x][y]=i;

     }

     for(int i=;i<=n;i++)

     {

         for(int j=;j<=n;j++){

             if(j==)

             printf("%d",mp[i][j]);

         else

             printf(" %d",mp[i][j]);

         }

         printf("\n");

     }

     return ;

 }