#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<long>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

int main (void){
    int N; cin>>N;
    VII m(N,VI(N,0));
    int cnt=1;
    int x=0,y=0;
    int xma=N,yma=N,xmi=0,ymi=0;
    int f=0;
    while(cnt<=N*N){
        if(m[x][y]==0) m[x][y]=cnt;
        else{
            if(f&(1<<0)){
                if(x+1<xma) x++;
                else{
                    yma--;
                    f=(1<<1);
                }
            }else if(f&(1<<1)){
                if(y-1>=ymi) y--;
                else{
                    xma--;
                    f=(1<<2);
                }
            }else if(f&(1<<2)){
                if(x-1>=xmi) x--;
                else{
                    ymi++;
                    f=0;
                }
            }else{
                if(y+1<yma) y++;
                else{
                    xmi++;
                    f=(1<<0);
                }
            }
            continue;
        }
        cnt++;
    }

    REP(i,N){
        REP(j,N){
            int mm=m[i][j];
            if(mm%100==mm){
                if(mm%10==mm) cout<<"00";
                else cout<<'0';
            }
            cout<<m[i][j]<<' ';
        }
        cout<<endl;
    }
}