#include <bits/stdc++.h>
int a[12][12];
int main() {
	memset(a, 0, sizeof(a));
	int n, x = 1, y = 1, t;
	scanf("%d", &n);
	t = a[1][1] = 1;
	while (t <= n * n) {
		if (y + 1 <= n && !a[x][y + 1])
			a[x][++y] = ++t;
		if (x + 1 <= n && !a[x + 1][y])
			a[++x][y] = ++t;
		if (y - 1 >= 1 && !a[x][y - 1])
			a[x][--y] = ++t;
		if (x - 1 >= 1 && !a[x - 1][y])
			a[--x][y] = ++t;
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++)
			printf("%3d", a[i][j]);
		printf("\n");
	}

	return 0;
}