#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>


ll n;
vector<ll> a, b;
int main() {
	cin >> n;
	for (int i = 1; i <= n * n; i += 2) {
		a.push_back(i);
	}
	for (int i = 2; i <= n * n; i += 2) {
		b.push_back(i);
	}
	REP(i, a.size()) {
		if (i % n != 0)cout << " ";
		cout << a[i];
		if (i % n == n - 1)cout << endl;
	}
	REP(i, n / 2) {
		FORR(j, (i + 1) * n - 1, i * n) {
			if (j != (i + 1) * n - 1)cout << " ";
			cout << b[j];
		}
		cout << endl;
	}
}