#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vec vector
#define INF INT_MAX
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

int main(){
    int x,y;
    int n;cin>>n;
    vec<vec<bool>> v(n,vec<bool>(n,false));
    int ct=1;
    vec<vec<int>> ans(n,vec<int>(n));
    v[0][0]=true;
    v[0][0]=ct;
    
    rep(i,0,n/2){
        x=i; y=i;
        ans[x][y]=ct;
        v[x][y]=true;
        ct++;
        int sx=1,sy=0;
        while(1){
            if(i<=x+sx&&x+sx<n-i&&i<=y+sy&&y+sy<n-i){
                if(v[y+sy][x+sx])break;
                x+=sx; y+=sy;
                v[y][x]=true;
                ans[y][x]=ct;
                ct++;
            }else {
                if(sx==1&&sy==0){
                    sx=0; sy=1;
                }else if(sx==-1&&sy==0){
                    sx=0; sy=-1;
                }else if(sx==0&&sy==1){
                    sx=-1; sy=0;
                }else if(sx==0&&sy==-1){
                    sx=1; sy=0;
                }
            }
        }
    }
    if(n%2){
        ans[n/2][n/2]=ct;
    }
    rep(i,0,n){
        rep(j,0,n){
            if(j)cout<<" ";
            printf("%03d",ans[i][j]);
        }
        cout<<endl;
    }
    return 0;
}