#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_set>
#include <vector>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

int INF = INT_MAX / 2;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int dy[4] = {0, -1, 0, 1};
int dx[4] = {-1, 0, 1, 0};

int main() {
	int N; cin >> N;
	vector<vector<int> > a(N, vector<int>(N));
	int y = 0, x = 0, k = 2;
	for (int i = 1; i <= N * N; i++) {
		a[y][x] = i;
		int _y = y + dy[k], _x = x + dx[k];
		if (!(_y >= 0 && _y < N && _x >= 0 && _x < N && !a[_y][_x])) {
			k = (k + 1) % 4;
			_y = y + dy[k]; _x = x + dx[k];
		}
		y = _y; x = _x;
	}
	for (int y = 0; y < N; y++) {
		for (int x = 0; x < N; x++)
			printf("%03d ", a[y][x]);
		cout << endl;
	}
}