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

int main() {
    int n;
    cin >> n;
    int ans[n][n];
    int idx = 1;
    if (n&1) ans[n/2][n/2] = n*n;
    for (int i = 0; i < n/2; i++) {
        for (int j = i; j < n-1-i; j++) ans[i][j] = idx++;
        for (int j = i; j < n-1-i; j++) ans[j][n-1-i] = idx++;
        for (int j = n-1-i; j > i; j--) ans[n-1-i][j] = idx++;
        for (int j = n-1-i; j > i; j--) ans[j][i] = idx++;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            printf("%03d ", ans[i][j]);
        puts("");
    }
    return 0;
}