#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;


    while (Q--) {
        int n;
        cin >> n;
        vector<vector<int>>r(34, vector<int>(34));
        for (int i = 0; i < n+1; i++) {
            r[n+1][i] = 1;
            r[i][n+1] = 1;
            r[0][i] = 1;
            r[i][0] = 1;
        }
        
        int d = 0;
        int t = 2;
        int x = 1, y = 1;
        r[1][1] = 1;
        while (t<=n*n) {
           
            if (!d) {
                if (r[y][x + 1])d++;
                else {
                    r[y][x + 1] = t; t++;
                    x++;
                }
            }
            if (d == 1) {
                if (r[y+1][x])d++;
                else {
                    r[y+1][x] = t; t++;
                    y++;
                }
            }
            if (d == 2) {
                if (r[y][x-1])d++;
                else {
                    
                    r[y ][x-1] = t; t++;
                    x--;
                }
            }
            if (d == 3) {
                if (r[y - 1][x])d=0;
                else {
                    r[y - 1][x] = t; t++;
                    y--;
                }
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (r[i][j] < 100)cout << 0;
                if (r[i][j] < 10)cout << 0;
                cout << r[i][j] << " ";
            }
            cout << endl;
        }
        
    }
    return 0;
}