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

int main() {
    int N;
    cin >> N;
    vector<vector<int> > v(N, vector<int>(N, -1));
    int x = 0, y = 0, dir = 0;
    int dx[] = {0, 1, 0, -1};
    int dy[] = {1, 0, -1, 0};
    for (int i = 0; i < N*N; i++) {
        v[x][y] = i+1;
        int nx = x + dx[dir];
        int ny = y + dy[dir];
        if (0 <= nx && nx < N && 0 <= ny && ny < N && v[nx][ny] < 0) {
            x = nx;
            y = ny;
        } else {
            dir++;
            dir%=4;
            x = x + dx[dir];
            y = y + dy[dir];
        }
    }

    for (auto i : v) {
        for (int j = 0; j < N-1; j++) printf("%03d ", i[j]);
        printf("%03d\n", i[N-1]);
    }

    return 0;
}