#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<vector<ll>> ans(n, vector<ll>(n, 0));
    ll x = 0, y = 0, dx = 1, dy = 0, cnt = 1;
    ans[y][x] = cnt;
    while(cnt < (n * n)) {
        if ((dx == 1) && ((x == (n - 1)) || (ans[y][x + 1] != 0))) dx = 0, dy = 1;
        else if ((dy == 1) && ((y == (n - 1)) || (ans[y + 1][x] != 0))) dx = -1, dy = 0;
        else if ((dx == -1) && ((x == 0) || (ans[y][x - 1] != 0))) dx = 0, dy = -1;
        else if ((dy == -1) && ((y == 0) || (ans[y - 1][x] != 0))) dx = 1, dy = 0;
        x += dx; y += dy;
        cnt++;
        ans[y][x] = cnt;
    }
    rep(i, n) {
        rep(j, n) {
            printf("%03lld%s", ans[i][j], (j == (n - 1)) ? "\n" : " ");
        }
    }
    return 0;
}