#include <iostream>
#include <string>

using namespace std;
int ma[31][31];
int vex[4] = {1, 0, -1, 0};
int vey[4] = {0, -1, 0, 1};
int n;
void dfs(int v, int depth, int x, int y)
{
    ma[x][y] = depth;
    if (depth == n * n)
        return;
    int nx = vex[v] + x, ny = vey[v] + y;
    while (ma[nx][ny] || 0 > nx || nx >= n || ny < 0 || ny >= n) {
        v = (v + 1) % 4;
        nx = vex[v] + x, ny = vey[v] + y;
    }
    nx = vex[v] + x, ny = vey[v] + y;
    dfs(v, depth + 1, nx, ny);
}
int main()
{
    cin >> n;
    dfs(0, 1, 0, 0);
    for (int j = 0; j < n; j++) {
        for (int i = 0; i < n; i++) {
            printf("%03d ", ma[i][j]);
        }
        printf("\n");
    }
}