#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int n;
    cin >> n;
    vector<vi> a(n,vi(n));
    int i = 0, j = 0;
    int dir = 0;
    int dx[] = {0,1,0,-1};
    int dy[] = {1,0,-1,0};
    rep(num,n*n){
        a[i][j] = num+1;
        int ni = i + dx[dir];
        int nj = j + dy[dir];
        if(ni < 0 || nj < 0 || ni >= n || nj >= n || a[ni][nj]){
            dir++;
            dir %= 4;
            ni = i + dx[dir];
            nj = j + dy[dir];
        }
        i = ni;
        j = nj;
    }
    rep(i,n)rep(j,n){
        printf("%03lld",a[i][j]);
        if(j<n-1)cout << " " ;
        else cout << endl;
    }
}