// #includes {{{
#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define RREP(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define LET(x,a) __typeof(a) x(a)
//#define IFOR(i,it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();++it,++i)
#define ALL(c) (c).begin(), (c).end()
#define MP make_pair

#define EXIST(e,s) ((s).find(e)!=(s).end())

#define RESET(a) memset((a),0,sizeof(a))
#define SET(a) memset((a),-1,sizeof(a))
#define PB push_back
#define DEC(it,command) __typeof(command) it=command

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define debug_v(x) cerr << #x << " = [";REP(__ind,(x).size()){cerr << (x)[__ind] << ", ";}cerr << "] (L" << __LINE__ << ")" << endl;

#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)

typedef long long Int;
typedef unsigned long long uInt;
typedef long double rn;

template<class T>
T inf(){
	return numeric_limits<T>::has_infinity?numeric_limits<T>::infinity():(numeric_limits<T>::max()/2);
}

typedef pair<int,int> pii;

/*
#ifdef MYDEBUG
#include"debug.h"
#include"print.h"
#endif
*/
// }}}


//{{{ io
FILE *file_in=stdin,*file_out=stdout;
#define fin normal_in
#define fout normal_out
//const char fname[]="";
//FILE *fin=fopen(fname,"r"),*fout=fopen(fname,"w");
#ifdef __MINGW32__
#define LLD "%I64d"
#define LLU "%I64u"
#else
#define LLD "%lld"
#define LLU "%llu"
#endif
struct NORMAL_IN{
	bool cnt;
	NORMAL_IN():cnt(true){}
	operator int() const {return cnt;}
#define endl "\n"
	NORMAL_IN& operator>>(int &n){cnt=fscanf(file_in,"%d",&n)!=EOF;return *this;}
	NORMAL_IN& operator>>(unsigned int &n){cnt=fscanf(file_in,"%u",&n)!=EOF;return *this;}
	NORMAL_IN& operator>>(long long &n){cnt=fscanf(file_in,LLD,&n)!=EOF;return *this;}
	NORMAL_IN& operator>>(unsigned long long &n){cnt=fscanf(file_in,LLU,&n)!=EOF;return *this;}
	NORMAL_IN& operator>>(double &n){cnt=fscanf(file_in,"%lf",&n)!=EOF;return *this;}
	NORMAL_IN& operator>>(long double &n){cnt=fscanf(file_in,"%Lf",&n)!=EOF;return *this;}
	NORMAL_IN& operator>>(char *c){cnt=fscanf(file_in,"%s",c)!=EOF;return *this;}
	NORMAL_IN& operator>>(string &s){
		s.clear();
		for(bool r=false;;){
			const char c=getchar();
			if(c==EOF){ cnt=false; break;}
			const int t=isspace(c);
			if(!r and !t)r=true;
			if(r){
				if(!t)s.push_back(c);
				else break;
			}
		}
		return *this;
	}
	template<class T>
		NORMAL_IN& operator>>(vector<T> &v){
			int v_size = v.size();
			REP(i,v_size){
				*this>>v[i];
			}
			return *this;
		}
} normal_in;

struct NORMAL_OUT{
	NORMAL_OUT& operator<<(const int &n){fprintf(file_out,"%d",n);return *this;}
	NORMAL_OUT& operator<<(const unsigned int &n){fprintf(file_out,"%u",n);return *this;}
	NORMAL_OUT& operator<<(const long long &n){fprintf(file_out,LLD,n);return *this;}
	NORMAL_OUT& operator<<(const unsigned long long &n){fprintf(file_out,LLU,n);return *this;}
	NORMAL_OUT& operator<<(const double &n){fprintf(file_out,"%lf",n);return *this;}
	NORMAL_OUT& operator<<(const long double &n){fprintf(file_out,"%Lf",n);return *this;}
	NORMAL_OUT& operator<<(const char c[]){fprintf(file_out,"%s",c);return *this;}
	NORMAL_OUT& operator<<(const string &s){fprintf(file_out,"%s",s.c_str());return *this;}
} normal_out;
struct ERR_OUT{
	template<class T>
		ERR_OUT& operator<<(const T &a){
			cerr<<"\x1b[7m"<<a<<"\x1b[m";
			return *this;
		}
} ferr;
//}}}

const int M = 500;

vector<int> pdiv, primes;

//{{{ eratosthenes
void sieve_of_eratosthenes(int n) {
	pdiv.assign(n,0);
	for (int i = 2; i < n; ++i)
		pdiv[i] = i;
	for (int i = 2; i*i < n; ++i)
		if (pdiv[i]==i)
			for (int j = i*i; j < n; j+=i)
				pdiv[j] = i;
	for(int p=2;p<n;p++)if(pdiv[p]==p)primes.push_back(p);
}

bool is_prime(int n){
	return n!=1 and pdiv[n]==n;
}
//}}}

Int N;

void check(const vector<vector<Int> > &a){
	REP(i,N-1)REP(j,N-1){
		{
			int i2 = i+1, j2 = j;
			if(a[i][j]<a[i2][j2])assert(a[i2][j2]%a[i][j]==1);
			else assert(a[i][j]%a[i2][j2]==1);
		}
		{
			int i2 = i, j2 = j + 1;
			if(a[i][j]<a[i2][j2])assert(a[i2][j2]%a[i][j]==1);
			else assert(a[i][j]%a[i2][j2]==1);
		}
	}
	set<Int> v;
	REP(i,N)REP(j,N)v.insert(a[i][j]),assert(1<=a[i][j] and a[i][j]<=1000000000000000ll);
	assert(v.size()==N*N);
}


Int type0(int i,int j){
	assert((i+j)%2==0);
	int a = (i-j)/2;
	a = (a%M+M)%M;
	return primes[a];
}

Int type1(int i,int j){
	assert((i+j)%2==0);
	int a = (i+j)/2;
	a = (a%M+M)%M;
	return primes[a+M];
}

Int calc(int i,int j){
	if((i+j)%2==0){
		return type0(i,j)*type1(i,j);
	}else{
		return type0(i-1,j)*type0(i+1,j)*type1(i-1,j)*type1(i+1,j)+1;
	}
}

void solve(){
	sieve_of_eratosthenes(100000);
	vector<vector<Int> > a(N,vector<Int>(N));
	REP(i,N){
		REP(j,N){
			a[i][j] = calc(i,j);
		}
	}
	REP(i,N){
		REP(j,N){
			fout<<a[i][j]<<" ";
		}
		fout<<endl;
	}
	check(a);
	return;
}

//{{{ main function
int main(){	

	fin >> N;
	solve();
	return 0;
}
//}}}

Measured memory_bytes: 17152