#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};


int table[30][30];

int main(){
    //*
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    /*/
      /*/

    int N;
    std::cin >> N;

    int dir = 0, x = 0, y = 0, n = 1;
    while(0 <= x && x < N && 0 <= y && y < N && table[y][x] == 0){
        table[y][x] = n;

        int nx = x + dx[dir], ny = y + dy[dir];
        if(nx < 0 || N <= nx || ny < 0 || N <= ny || table[ny][nx] > 0){
            dir = (dir + 1) % 4;
            nx = x + dx[dir]; ny = y + dy[dir];
        }

        x = nx; y = ny; ++n;
        // printf("%d, %d\n", nx, ny);
    }

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