#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;
#define rep(i,k) for (int i = 0; i < (int)(k); i++)
#define all(c) begin(c), end(c)


int main() {
    int n;
    while (cin >> n) {
        int g[50][50];
        int x = 0;
        int ci = 0, cj = 0;
        int w = n - 1;
        while (w >= 1) {
            for (int i = 0; i < w; ++i) {
                g[ci][cj] = ++x;
                ++cj;
            }
            for (int i = 0; i < w; ++i) {
                g[ci][cj] = ++x;
                ++ci;
            }
            for (int i = 0; i < w; ++i) {
                g[ci][cj] = ++x;
                --cj;
            }
            for (int i = 0; i < w; ++i) {
                g[ci][cj] = ++x;
                if (i != w - 1) --ci;
            }
            w -= 2;
            ++cj;
        }
        if (n & 1) g[n / 2][n / 2] = n*n;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                printf("%03d%c", g[i][j], j == n - 1 ? '\n' : ' ');
            }
        }
    }
}