#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
int p = 998244353;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp make_pair
#define pin pair<int,int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define sq(a) (a)*(a)
#define rev(s) reverse(s.begin(),s.end())
#define end_program(s) cout << s <<endl;return 0
int kai_size = 500001;
vel kai(kai_size, 1);
vel ink(kai_size, 1);
vel dist;
int RE() {
	vel v(3, 2);
	return v.at(4); 
}
int ru(int a, int r) {
	if (r == 0) { return 1; }
	int ans = ru(a, r / 2);
	ans *= ans; ans %= p;
	if (r % 2 == 1) { ans *= a; }
	return ans % p;
}
int inv(int a) {
	return ru(a, p - 2);
}
void make_kai() {
	rep(i, kai_size-1) { kai[i + 1] = (kai[i] * (i + 1)) % p; }
	rep(i, kai_size) { ink[i] = inv(kai[i]); }
}
int com(int n, int r) {
	if (r < 0 || n < r) { return 0; }
	int ans = kai[n] * ink[r];
	ans %= p; ans *= ink[n - r]; ans %= p;
	return ans;
}
vel dis(int mid1, vvel &way) {
	int n = way.size();
	vel dist(n, -1); dist[mid1] = 0;
	queue<int> q;
	q.push(mid1);
	while (!q.empty()) {
		int st = q.front(); q.pop();
		rep(i, way[st].size()) {
			int to = way[st][i];
			if (dist[to] == -1) {
				dist[to] = dist[st] + 1;
				q.push(to);
			}
		}
	}
	return dist;
}
pin most_far(int now, int n, vvel &way) {
	vel dist1 = dis(now, way);
	pin ans = mkp(-1, 0);
	rep(i, n) {
		if (dist1[i] > ans.first) { ans = mkp(dist1[i], i); }
	}
	return ans;
}

int per(int a, int b) {
	int ans = a % b;
	if (ans < 0) { ans += b; }
	return ans;
}
vel uni(vel &v) {
	sor(v);
	vel ans(1, v[0]);
	for (int i = 1; i < v.size(); i++) {
		if (v[i] != v[i-1]) { ans.push_back(v[i]); }
	}
	v = ans;
	return v;
}
int s_gcd(int a, int b) {
	if (b == 0) { return a; }
	return s_gcd(b, a%b);
}
int gcd(int a, int b) {
	if (a < b) { swap(a, b); }
	return s_gcd(a, b);
}
bool is_prime(int i) {
	for (int j = 2; j*j <= i; j++) {
		if (i%j == 0) { return false; }
	}
	return true;
}
int get(int i, int j, vvel &ans) {
	int n = ans.size();
	if (i < 0 || n <= i || j < 0 || n <= j) { return 1; }
	return ans[i][j];
}
int lcm(int a, int b) {
	return a * b / gcd(a, b);
}
int solve(int a, int b) {
	if (a < b) { swap(a, b); }
	if (b == 1) { return 1; }
	return a % b;
}
signed main() {
	int n; cin >> n;
	vel prime(0);
	int mod = 510;
	for (int i = 1000; i < 10000; i++) {
		if (is_prime(i)) { prime.push_back(i); }
	}
	vvel ans(n, vel(n,1));
	rep(i, n) {
		rep(j, n) {
			if ((i + j) % 2 == 0) {
				int x = (i + j) / 2;
				int y = per((i - j) / 2, mod);
				ans[i][j] = prime[x] * prime[y];
			}
		}
	}
	rep(i, n) {
		rep(j, n) {
			if ((i + j) % 2 == 1) {
				j--;
				int x = (i + j) / 2;
				int y = per((i - j) / 2, mod);
				ans[i][j+1] = prime[x] * prime[y];
				j += 2;
				x = (i + j) / 2;
				y = per((i - j) / 2, mod);
				ans[i][j-1] *= prime[x] * prime[y];
				j--;
				ans[i][j]++;
			}
			cout << ans[i][j];
			if (j == n - 1) { cout << endl; }
			else { cout << " "; }
		}
	}
	return 0;
}

#include<iostream>
#include<cstdio>
using namespace std;
int n,sz;
int a[10101],d[10101];
long long an[1010][1010];
void init(int N)
{
	for(int i=2;i<=N;i++)
	{
		if(!d[i])a[++sz]=i;
		for(int j=1;j<=sz&&a[j]*i<=N;j++)
		{
			d[i*a[j]]=1;
			if(i%a[j]==0) break;
		}
	}
}
long long gcd(long long x,long long y){ return y?gcd(y,x%y):x;}
long long lcm(long long x,long long y)
{
	if(!x||!y) return x+y;
	return x/gcd(x,y)*y;
}
int main()
{
	scanf("%d",&n);
	init(10000);
	if(n==2)
	{
		an[1][1]=4;an[1][2]=7;an[2][1]=23;an[2][2]=10;
	}
	else
	{
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
			if((i+j)&1)
				an[i][j]=1LL*a[(i+j)/2]*a[(i-j+n)/2+1+n];
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
			if(((i+j)&1)^1)
				an[i][j]=lcm(lcm(an[i-1][j],an[i+1][j]),lcm(an[i][j-1],an[i][j+1]))+1;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		printf("%lld ",an[i][j]);
		puts("");
	}
	return 0;
}