/*
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
	int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
		return x ^ (x >> 7) ^ (x >> 4);
	}
};

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;
random_device(rd);
mt19937 rng(rd());

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 513
#define MAXP 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N;
int sp[MAXP];
vector<ll> primes;
ll ans[MAXN][MAXN];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
unordered_set<ll> presents;
ll gg1[2 * MAXN], gg2[2 * MAXN];
ll f1[6] = {1, 2, 3, 4, 6, 12}, f2[6] = {12, 6, 4, 3, 2, 1};

ll gcd(ll a, ll b)
{
	return (b == 0 ? a : gcd(b, a % b));
}
ll lcm(ll a, ll b)
{
	if (a == 0) return b;
	if (b == 0) return a;
	ll g = gcd(a, b);
	return a / g * b;
}
bool valid(int x, int y)
{
	return (0 <= x && x < N && 0 <= y && y < N);
}
ll mind(ll x)
{
	//-N-1...N-1
	x += (N - 1);
	return gg1[x];
	// return (primes[x] < 4000 ? primes[x] : primes[x] / 2);
}
ll plud(ll x)
{
	//0...2N-2
	return gg2[x];
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// freopen ("file.in", "r", stdin);
	// freopen ("file.out", "w", stdout);
	cin >> N;
	N += 2;
	for (int i = 2; i < MAXP; i++)
	{
		if (sp[i] == 0)
		{
			sp[i] = i;
			primes.PB(i);
		}
		for (ll p : primes)
		{
			if (p > sp[i] || i * p >= MAXP)
			{
				break;
			}
			sp[i * p] = p;
		}
	}
	while(true)
	{
		// cerr << "test\n";
		for (int i = 0; i <= 2 * N; i++)
		{
			gg1[i] = primes[i / 6 + 3] * f1[i % 6];
			gg2[i] = primes[i / 6 + 3] * f2[i % 6];
		}
		for (int i = 0; i < N; i++)
		{
			for (int j = 0; j < N; j++)
			{
				if ((i + j) % 2 == 0)
				{
					continue;
				}
				ans[i][j] = lcm(mind(i - j), plud(i + j));
				ll rec = ans[i][j];
				while(presents.find(ans[i][j]) != presents.end())
				{
					ans[i][j] += rec;
				}
				if (i != 0 && j != 0 && i != N - 1 && j != N - 1) presents.insert(ans[i][j]);
			}
		}
		for (int i = 0; i < N; i++)
		{
			for (int j = 0; j < N; j++)
			{
				if ((i + j) % 2)
				{
					continue;
				}
				for (int k = 0; k < 4; k++)
				{
					if (valid(i + dx[k], j + dy[k]))
					{
						ans[i][j] = lcm(ans[i][j], ans[i + dx[k]][j + dy[k]]);
					}
				}
				ll rec = ans[i][j];
				while(presents.find(ans[i][j] + 1) != presents.end())
				{
					ans[i][j] += rec;
				}
				ans[i][j]++;
				if (i != 0 && j != 0 && i != N - 1 && j != N - 1) presents.insert(ans[i][j]);
			}
		}
		// cerr << "set\n"
		break;
	}
	for (int i = 1; i < N - 1; i++)
	{
		for (int j = 1; j < N - 1; j++)
		{
			if (j != 1) cout << ' ';
			cout << ans[i][j];
		}
		cout << '\n';
	}
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}


Measured memory_bytes: 14920