#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class T>
T Next() { T buf; cin >> buf; return buf; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#include "Segment_Tree.h"
#include "BIT.h"
#include "Rational.h"
#include "Position.h"
#include "Factorization.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
// template <class T>
// auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif

int N;
LL A[500][500];

LL GCD(LL a, LL b) {
	if (b == 0) return a;
	return GCD(b, a % b);
}
LL LCM(LL a, LL b) {
	return a / GCD(a, b) * b;
}

const int di[] = { 1, 0, -1, 0 };
const int dj[] = { 0, 1, 0, -1 };

vector<int> primes;
vector<int> primes1;
vector<int> primes2;

void pre() {
	const int MAX = 300000;
	
	REP(i, 2, MAX) {
		bool pr = true;
		for (int div = 2; div * div <= i; ++div) {
			if (i % div == 0) {
				pr = false;
			}
		}
		if (pr) primes.push_back(i);
	}

	//for (int i = 0; i < primes.size(); ++i) {
	//	(i % 2 == 0 ? primes1 : primes2).push_back(primes[i]);
	//}

	for (int i = 0; i < N; ++i) {
		primes1.push_back(primes[i]);
	}
	for (int i = N; i < 2 * N; ++i) {
		primes2.push_back(primes[i]);
	}
}

void sub() {
	cin >> N;
	if (N == 2) {
		cout << "4 7" << endl;
		cout << "23 10" << endl;
		return;
	}
	pre();

	REP(i, 0, N) {
		REP(j, 0, N) {
			A[i][j] = primes1[(N + i - j) / 2] * primes2[(i + j) / 2];
		}
	}

	REP(i, 0, N) {
		REP(j, 0, N) {
			if (i % 2 == j % 2) continue;
			vector<LL> v;
			REP(k, 0, 4) {
				int ni = i + di[k];
				int nj = j + dj[k];
				if (Inside(ni, nj, N, N)) {
					v.push_back(A[ni][nj]);
				}
			}

			LL lcm = 1;
			for (LL p : v) {
				lcm = LCM(lcm, p);
			}
			A[i][j] = lcm + 1;
		}
	}

	REP(i, 0, N) {
		REP(j, 0, N) {
			cout << A[i][j] << (j == N - 1 ? '\n' : ' ');
		}
	}
}

int main() {
	sub();
	return 0;
}

Measured memory_bytes: 5376