#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

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

    int a[n][n];
    rep(i,n)rep(j,n)a[i][j] = -1;

    int k = 0;
    int now = 1;
    while(true){
        srep(i,k,n-k){
            a[k][i] = now;
            now++;
        }
        srep(i,k+1,n-1-k){
            a[i][n-1-k] = now;
            now++;
        }
        for(int i = n-1-k; i >= k; i--){
            a[n-1-k][i] = now;
            now++;
        }
        for(int i = n-2-k; i >= k+1; i--){
            a[i][k] = now;
            now++;
        }
        k++;
        if(a[k][k] != -1)break;
    }

    rep(i,n){
        rep(j,n){
            cout << setfill('0') << right << setw(3) << a[i][j] << ' ';
        }
        cout << endl;
    }

    return 0;
}