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

vector<vector<int>> oddMagicSquare(int n) {
	assert(n % 2 == 1);
	vector<vector<int>> a(n, vector<int>(n));
	int y = 0;
	int x = n / 2;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			a[y][x] = i * n + j + 1;
			x = (x + 1) % n;
			y = (y + n - 1) % n;
		}
		x = (x + n - 1) % n;
		y = (y + 2) % n;
	}
	return a;
}

vector<vector<int>> fourMagicSquare(int n) {
	assert(n % 4 == 0);
	vector<vector<int>> a(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (((i + 1) / 2 + (j + 1) / 2) % 2 == 0) {
				a[i][j] = i * n + j + 1;
			} else {
				a[n - 1 - i][n - 1 - j] = i * n + j + 1;
			}
		}
	}
	return a;
}

vector<vector<int>> fourTwoMagicSquare(int n) {
	assert(n % 4 == 2);
	auto b = oddMagicSquare(n / 2);
	for (int i = 0; i < n / 2; i++) {
		for (int j = 0; j < n / 2; j++) {
			b[i][j] = (b[i][j] - 1) * 4;
		}
	}
	vector<vector<int>> L = { { 4, 1 }, { 2, 3 } };
	vector<vector<int>> U = { { 1, 4 }, { 2, 3 } };
	vector<vector<int>> X = { { 1, 4 }, { 3, 2 } };
	vector<vector<int>> a(n, vector<int>(n));
	for (int i = 0; i < n / 2; i++) {
		for (int j = 0; j < n / 2; j++) {
			vector<vector<int>> A;
			if (i < n / 4) {
				A = L;
			} else if (i == n / 4) {
				if (j == n / 4) {
					A = U;
				} else {
					A = L;
				}
			} else if (i == n / 4 + 1) {
				if (j == n / 4) {
					A = L;
				} else {
					A = U;
				}
			} else {
				A = X;
			}
			for (int ii = 0; ii < 2; ii++) {
				for (int jj = 0; jj < 2; jj++) {
					a[i * 2 + ii][j * 2 + jj] = b[i][j] + A[ii][jj];
				}
			}
		}
	}
	return a;
}

vector<vector<int>> magicSquare(int n) {
	if (n % 2 == 1) {
		return oddMagicSquare(n);
	} else if (n % 4 == 0) {
		return fourMagicSquare(n);
	} else {
		return fourTwoMagicSquare(n);
	}
}

int main() {
	int n;
	cin >> n;

	auto a = magicSquare(n);

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}