/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 8e3+10;
int p[SIZE];
vector<int>pp;
void prime_init(){
    for(int i=2;i<SIZE;i++){
        if(!p[i]){
            pp.PB(i);
            for(int j=i;j<SIZE;j+=i){
                if(!p[j])p[j]=i;
            }
        }
    }
}
bool is_prime(int x){
    return p[x]==x;
}
LL an[500][500];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
LL lcm(LL x,LL y){return x/__gcd(x,y)*y;}
set<LL>AA;
int main(){
    prime_init();
    int N;
    R(N);
    REP(i,N)REP(j,N)an[i][j]=1;
    int ll=0,rr=1000;
    int now=0;
    for(int i=0;i<2*N-1;i+=2){
        if(!now){
            for(int j=0;j<=i&&j<N;j++){
                if(i-j<N)an[j][i-j]*=pp[ll];
            }
            ll++;
        }
        else{
            for(int j=0;j<=i&&j<N;j++){
                if(i-j<N)an[j][i-j]*=pp[rr];
            }
            rr--;
        }
        now^=1;
    }
    for(int i=-((N-1)&(~1));i<N;i+=2){
        if(!now){
            REP(j,N){
                if(i+j>=0&&i+j<N){
                    an[i+j][j]*=pp[ll];
                }
            }
            ll++;
        }
        else{
            REP(j,N){
                if(i+j>=0&&i+j<N){
                    an[i+j][j]*=pp[rr];
                }
            }
            rr--;
        }
        now^=1;
    }
    //REP(i,N)W(VL(an[i],an[i]+N));
    LL ma=0;
    REP(i,N)REP(j,N){
        if(an[i][j]!=1)continue;
        LL v=0;
        REP(k,4){
            int x=i+dx[k];
            int y=j+dy[k];
            if(x>=0&&y>=0&&x<N&&y<N){
                if(!v)v=an[x][y];
                else v=lcm(an[x][y],v);
            }
        }
        int tt=1;
        while(AA.count(v*tt+1))tt++;
        an[i][j]=v*tt+1;
        ma=max(ma,an[i][j]);
        AA.insert(v*tt+1);
    }
    REP(i,N)W(VL(an[i],an[i]+N));
    return 0;
}


Measured memory_bytes: 11008