#include <bits/stdc++.h>
#include <format>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
const int dx4[4] = { 0, 1, 0, -1 };
const int dy4[4] = { 1, 0, -1, 0 };
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector a(n, vector<int>(n, -1));
	int x = 0, y = 0;
	a[x][y] = 1;
	int t = 0;
	int c = 2;
	while (c <= n * n) {
		int nx = x + dx4[t];
		int ny = y + dy4[t];
		if (nx < 0 || nx >= n) {
			t = (t + 1) % 4;
			continue;
		}
		if (ny < 0 || ny >= n) {
			t = (t + 1) % 4;
			continue;
		}
		if (a[nx][ny] != -1) {
			t = (t + 1) % 4;
			continue;
		}
		x = nx, y = ny;
		a[nx][ny] = c;
		c++;
	}
	rep(i, n) {
		rep(j, n) {
			cout << std::format("{:03}", a[i][j]) << " ";
		}cout << endl;
	}
	return 0;
}