#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <array>
#include <chrono>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cout << #d << "\t:" << d << "\t";}
#define SHOWVECTOR(v) {std::cout << #v << "\t:";for(const auto& i : v){std::cout << i << " ";}std::cout << "\n";}
#define SHOWVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout << j << " ";}std::cout << "\n";}}
#define SHOWPAIRVECTOR2(v) {std::cout << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cout<<'('<<j.first<<", "<<j.second<<") ";}std::cout << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& i:v){std::cout<<'('<<i.first<<", "<<i.second<<") ";}std::cout<<"\n";}
#define CHECKTIME(state) {auto start=std::chrono::system_clock::now();state();auto end=std::chrono::system_clock::now();auto res=std::chrono::duration_cast<std::chrono::nanoseconds>(end-start).count();std::cerr<<"[Time:"<<res<<"ns  ("<<res/(1.0e9)<<"s)]\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cout << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";}
#define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a))
#define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a))

//#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;
constexpr ll INFLL = 1LL << 60;
constexpr double EPS = 0.0000000001;
constexpr int MOD = 1000000007;

signed main() {
	INIT;
	VAR(int, n);
	std::vector<std::vector<int>> m(n, std::vector<int>(n, 0));
	if (n & 1) {
		int num = 1;
		int i = 0, j = n / 2;
		while (num <= n*n) {
			m[i][j] = num++;
			i = (i - 1 + n) % n;
			j = (j + 1) % n;
			if (m[i][j] != 0) {
				i = (i + 2) % n;
				j = (j - 1 + n) % n;
			}
		}
	}
	else if (n % 4 == 0) {
		std::vector<std::vector<bool>> bit(n, std::vector<bool>(n, false));
		REP(i, n) REP(j, n) {
			bool t = true;
			if (i % 4 == 0 || i % 4 == 3) t = false;
			if (j % 4 == 0 || j % 4 == 3) t ^= true;
			bit[i][j] = t;
		}
		int up = 1, down = n*n;
		REP(i, n) REP(j, n) {
			if (bit[i][j]) m[i][j] = up;
			else m[i][j] = down;
			++up; --down;
		}
	}
	else {
		int tn = n / 2;
		std::vector<std::vector<int>> base(tn, std::vector<int>(tn, 0));
		int num = 1;
		int i = 0, j = tn / 2;
		while (num <= tn*tn) {
			base[i][j] = num++;
			i = (i - 1 + tn) % tn;
			j = (j + 1) % tn;
			if (base[i][j] != 0) {
				i = (i + 2) % tn;
				j = (j - 1 + tn) % tn;
			}
		}
		REP(i, tn) REP(j, tn) {
			m[i * 2][j * 2] = (base[i][j] - 1) * 4;
			m[i * 2 + 1][j * 2] = (base[i][j] - 1) * 4;
			m[i * 2][j * 2 + 1] = (base[i][j] - 1) * 4;
			m[i * 2 + 1][j * 2 + 1] = (base[i][j] - 1) * 4;
		}
		REP(i, n) REP(j, n) {
			if (i < n / 2) {
				if (i % 2 == 0 && j % 2 == 0) m[i][j] += 4;
				if (i % 2 == 1 && j % 2 == 0) m[i][j] += 2;
				if (i % 2 == 0 && j % 2 == 1) m[i][j] += 1;
				if (i % 2 == 1 && j % 2 == 1) m[i][j] += 3;
			}
			else if (i == n / 2) {
				if (i % 2 == 0 && j % 2 == 0) m[i][j] += 1;
				if (i % 2 == 1 && j % 2 == 0) m[i][j] += 2;
				if (i % 2 == 0 && j % 2 == 1) m[i][j] += 4;
				if (i % 2 == 1 && j % 2 == 1) m[i][j] += 3;
			}
			else {
				if (i % 2 == 0 && j % 2 == 0) m[i][j] += 1;
				if (i % 2 == 1 && j % 2 == 0) m[i][j] += 3;
				if (i % 2 == 0 && j % 2 == 1) m[i][j] += 4;
				if (i % 2 == 1 && j % 2 == 1) m[i][j] += 2;
			}
		}
		m[tn + 0 + 0][tn + 0] += -3;
		m[tn + 0 + 0][tn + 1] +=  3;
		m[tn + 2 + 0][tn + 0] +=  3;
		m[tn + 2 + 0][tn + 1] += -3;
	}
	REP(i, n) {
		REP(j, n) {
			OUT(m[i][j])SP;
		}BR;
	}
	return 0;
}