#include <bits/stdc++.h>
using namespace std;

#define int long long

const int INF = LLONG_MAX/2;
const int dx[] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int N;
int fld[30][30];
bool isUsed[30][30];

void DFS(int x, int y, int d, int cnt)
{
	fld[y][x] = cnt;
	for (int i = 0; i < 4; i++)
	{
		int nx = x + dx[(d + i) % 4], ny = y + dy[(d + i) % 4];
		if (nx < 0 || N <= nx || ny < 0 || N <= ny || isUsed[ny][nx]) continue;
		isUsed[ny][nx] = true;
		DFS(nx, ny, (d + i) % 4, ++cnt);
		break;
	}
}

signed main()
{
	isUsed[0][0] = true;
	cin >> N;
	DFS(0, 0, 0, 1);
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			if (j) printf(" ");
			printf("%03lld", fld[i][j]);
		}
		puts("");
	}
	return 0;
}