#include <stdio.h>

int main() {
	int n;
	scanf("%d", &n);

	int map[30][30] = {};
	enum status { Right, Down, Left, Up } state = Right;

	int x = 0, y = 0;
	int i, j;
	for (i = 1; i <= n * n; i++) {
		map[x][y] = i;
		if (i == n * n) break;

		switch (state) {
			case Right:
				if (x + 1 >= n || map[x + 1][y] > 0) {
					state = Down;
					i--;
				}
				else x++;
				break;

			case Down:
				if (y + 1 >= n || map[x][y + 1] > 0) {
					state = Left;
					i--;
				}
				else y++;
				break;

			case Left:
				if (x - 1 < 0 || map[x - 1][y] > 0) {
					state = Up;
					i--;
				}
				else x--;
				break;

			case Up:
				if (y - 1 < 0 || map[x][y - 1] > 0) {
					state = Right;
					i--;
				}
				else y--;
				break;
		}
	}

	for (i = 0; i < n; i++) {
		for (j = 0; j < n; j++) {
			printf("%03d", map[j][i]);
			if (j < n - 1) printf(" ");
		}
		printf("\n");
	}
	return 0;
}