#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

void oddMagicSquare(int N, vector<vi> &a) {
	int i = 0, j = N / 2;
	a.assign(N, vi(N));
	int sqr = N * N;
	rer(k, 1, sqr) {
		a[i][j] = k;
		-- i, ++ j;
		if(k % N == 0) {
			i += 2;
			-- j;
		}else {
			if(j == N) {
				j -= N;
			}else if(i < 0) {
				i += N;
			}
		}
	}
}

int main() {
	int N;
	while(cin >> N) {
		vector<vi> a(N, vi(N));
		if(N % 2 == 1) {
			oddMagicSquare(N, a);
		}else if(N % 4 == 0) {
			vector<vi> I(N, vi(N, 0)), J = I;
			int k = 1;
			rep(i, N) rep(j, N)
				a[i][j] = k ++;
			rep(i, N) rep(j, N) if((i + 1) % 4 / 2 == (j + 1) % 4 / 2)
				a[i][j] = N * N + 1 - a[i][j];
		}else {
			int p = N / 2, pp = p * p;
			vector<vi> M;
			oddMagicSquare(p, M);

			rep(i, p) rep(j, p) {
				a[i][j] = M[i][j];
				a[i+p][j] = M[i][j] + 3*pp;
				a[i][j+p] = M[i][j] + 2*pp;
				a[i+p][j+p] = M[i][j] + pp;
			}

			vi I(p, 0), J;
			rep(i, p) I[i] = i+1;
			int k = (N - 2) / 4;
			rep(i, k) J.push_back(i);
			reu(i, N - k + 1, N) J.push_back(i);
			rep(i, p) rep(j, J.size())
				swap(a[i][J[j]], a[i+p][J[j]]);
			swap(a[k][0], a[k+p][0]);
			swap(a[k][k], a[k+p][k]);
		}
		/*
		rep(i, N) {
			int s = 0, t = 0;
			rep(j, N) {
				s += a[i][j];
				t += a[j][i];
			}
			cerr << s << ", " << t << endl;
		}*/
		rep(i, N) {
			rep(j, N) {
				if(j != 0) putchar(' ');
				printf("%d", a[i][j]);
			}
			puts("");
		}
	}
	return 0;
}