#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};

int main(){
    int n;
    cin >> n;

    vector<vector<int>> table(n,vector<int>(n,0));
    int x=0,y=0;
    int f=0;
    for(int i=1;i<=n*n;i++){
        table[x][y]=i;

        int nx=x+dx[f];
        int ny=y+dy[f];
        if(nx<0 or nx>=n or ny<0 or ny>=n or table[nx][ny]!=0){
            f = (f+1) % 4;
        }
        x = x + dx[f];
        y = y + dy[f];
    }

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            printf("%03d ",table[i][j]);
        }
        cout << endl;
    }
}