#include<iostream>
#include<vector>

using namespace std;
vector<vector<int> > v(32, vector<int>(32, 0));
int N, n=1;

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

}

void solve(int d, int i,  int j){
    if(n==N*N){
        print();
        return;
    }
    switch(d%4){
        case 0: while(1){
                    v[i][j]=n;
                    if(v[i][j+1]!=0) break;
                    n++; j++;
                }
                break;
        case 1: while(1){
                    v[i][j]=n;
                    if(v[i+1][j]!=0) break;
                    n++; i++;
                }
                break;
        case 2: while(1){
                    v[i][j]=n;
                    if(v[i][j-1]!=0) break;
                    n++; j--;
                }
                break;
        case 3: while(1){
                    v[i][j]=n;
                    if(v[i-1][j]!=0) break;
                    n++; i--;
                }
                break;
    }
    solve(d+1, i, j);
}

int main(){
    cin>> N;

    for(int i=0; i<=31; i++) v[i][0]=v[0][i]=-1;
    for(int i=N+1; i<=31; i++)
        for(int j=1; j<=31; j++)
            v[i][j]=v[j][i]=-1;
    v[1][1]=1;

    solve(0, 1, 1);

    return 0;
}