#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <assert.h>
#include <sys/time.h>
#include <fstream>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define REP(i,n)  FOR(i,0,n)
#define each(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define deb(x) cerr << #x << " = " << (x) << " , ";
#define debl cerr << " (L" << __LINE__ << ")"<< endl;
#define sz(s) (int)((s).size())


#define clr(a) memset((a),0,sizeof(a))
#define nclr(a) memset((a),-1,sizeof(a))
#define pb push_back
#define INRANGE(x,s,e) ((s)<=(x) && (x)<(e))
#define MP(x,y) make_pair((x),(y))

double pi=3.14159265358979323846;

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;

template<typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& z){
	os << "[ ";
	REP(i,z.size())os << z[i] << ", " ;
	return ( os << "]" << endl);
}

template<typename T> std::ostream& operator<<(std::ostream& os, const set<T>& z){
	os << "set( ";
	EACH(p,z)os << (*p) << ", " ;
	return ( os << ")" << endl);
}

template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const map<T,U>& z){
	os << "{ ";
	EACH(p,z)os << (p->first) << ": " << (p->second) << ", " ;
	return ( os << "}" << endl);
}

template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const pair<T,U>& z){
	return ( os << "(" << z.first << ", " << z.second << ",)" );
}

double get_time(){
	struct timeval tv;
	gettimeofday(&tv, NULL);
	return tv.tv_sec + tv.tv_usec*1e-6;
}

typedef unsigned int uint32_t;
struct RND{
	uint32_t x;
	uint32_t y;
	uint32_t z;
	uint32_t w;
	RND(){
		x=123456789;
		y=362436069;
		z=521288629;
		w=88675123;
	}
	void init(int seed){
		x=123456789;
		y=362436069;
		z=521288629;
		w=seed+100;
		REP(i,10)get();
	}
	uint32_t get(){
		uint32_t t;
		t=x^(x<<11);
		x=y;y=z;z=w;
		w=(w^(w>>19))^(t^(t>>8));
		return w;
	}
};
RND rnd;

ll gcd(ll x, ll y){
	if(y==0)return x;
	return gcd(y,x%y);
}

ll lcm(ll x, ll y){
	return x/gcd(x,y)*y;
}

void _main(istream &inp){
	int n;
	inp >> n;
	const int M = 1000;
	vvl ret(n, vl(n));
//	debug(n);
//	debug(ret);
	set<ll> u;
	rep(x,n) rep(y,n){
		if((x+y)%2==0){
			ll tt = (x/2+800)*((x+y)/2+800);
			ll t = tt;
			while(exist(u,t))t+=tt;
			u.insert(t);
			ret[x][y]=t;
		}
	}
	ll maxi = 0;
	rep(x,n) rep(y,n){
		if((x+y)%2==1){
			ll z = 1;
			if(x>0)z=lcm(z,ret[x-1][y]);
			if(y>0)z=lcm(z,ret[x][y-1]);
			if(x+1<n)z=lcm(z,ret[x+1][y]);
			if(y+1<n)z=lcm(z,ret[x][y+1]);
			ll val = z+1;
			while(exist(u,val))val+=z;
			u.insert(val);
			maxi = max(maxi, val);
			ret[x][y]=val;
		}
	}
	debug(1.0*maxi/1e15);
	assert(maxi<1e15);
	//debug(n);
	//debug(ret);
	set<ll> check;
	rep(x,n) rep(y,n) check.insert(ret[x][y]);
	assert(check.size()==n*n);
	rep(x,n) rep(y,n-1){
		ll a = ret[x][y];
		ll b = ret[x][y+1];
		assert(max(a,b)%min(a,b)==1);
	}
	rep(x,n-1) rep(y,n){
		ll a = ret[x][y];
		ll b = ret[x+1][y];
		assert(max(a,b)%min(a,b)==1);
	}
	//return;
	rep(x,n){
		rep(y,n){
			cout << ret[x][y];
			if(y!=n-1)cout << " ";
			else cout << endl;
		}
	}


}

int main(){
	if(0){
		ifstream ifs("test.txt");
		_main(ifs);
	}
	else{
		_main(cin);
	}
	return 0;
}


Measured memory_bytes: 28288