#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
#define ce(x, y) (x + y - 1) / y
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
constexpr int dx[] = {0, 1, 0, -1};
constexpr int dy[] = {-1, 0, 1, 0};
int main() {
	int n; cin >> n;
	vv(int, v, n, n, -1);
	int muki = 1;
	int y = 0, x = 0, ny, nx;
	rep(i, 1, (n * n) + 1) {
		v[y][x] = i;
		ny = y + dy[muki];
		nx = x + dx[muki];
		if (ny < 0 || n <= ny || nx < 0 || n <= nx || v[ny][nx] != -1) {
			muki = (muki + 1) % 4;
			ny = y + dy[muki];
			nx = x + dx[muki];
		}
		y = ny;
		x = nx;
	}
	rep(i, 0, n) {
		rep(j, 0, n - 1) {
			cout << setw(3) << setfill('0') << v[i][j] << " ";
		}
		cout << setw(3) << setfill('0') << v[i][n - 1] << endl;;
	}
	return 0;
}