#include<bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define ll long long
using namespace std;
typedef pair<char,int> pii;
set<ll>mapa;
const int maxv=2300000;
int n,pos[maxv+10],br;
ll primes[maxv],rows[1010],cols[1010],aa[519][510];
vector<ll>a[510][510];
void check(){

ll maxx=LONG_MIN;
ll minn=LONG_MAX;
set<ll>mapa2;
    for(int i=1;i<=n;i++){

        for(int j=1;j<=n;j++){

            if(i<n){
               /// mapa.insert(max(a[i][j],a[i+1][j])%min(a[i][j],a[i+1][j]));
            }
            if(j<n){
                ///mapa.insert(max(a[i][j],a[i][j+1])%min(a[i][j],a[i][j+1]));
            }

            maxx=max(maxx,aa[i][j]);
            minn=min(minn,aa[i][j]);
            mapa2.insert(aa[i][j]);
        }

    }
printf("%d %d %lld %lld\n",mapa.size(),mapa2.size(),maxx,minn);
}
void sito(){

    for(int i=2;i<=maxv;i++){
        if(pos[i])continue;
        primes[++br]=i;
        for(int j=i;j<=maxv;j+=i)pos[j]=1;
    }

}
ll lcm(ll a,ll b){
  return (a*b)/__gcd(a,b);
}
void fix(int x,int y){

    ll lc=1;
    set<ll>mm;

    if(aa[x+1][y]!=0)
        for(int i=0;i<a[x+1][y].size();i++)mm.insert(a[x+1][y][i]);
    if(aa[x-1][y]!=0)
        for(int i=0;i<a[x-1][y].size();i++)mm.insert(a[x-1][y][i]);
    if(aa[x][y+1]!=0)
        for(int i=0;i<a[x][y+1].size();i++)mm.insert(a[x][y+1][i]);
    if(aa[x][y-1]!=0)
        for(int i=0;i<a[x][y+1].size();i++)mm.insert(a[x][y-1][i]);

    for(set<ll>::iterator it=mm.begin();it!=mm.end();it++)lc*=*it;

    if(lc>1e15){
       /// printf("AAAA %lld %lld %lld %lld %lld\n",a[x+1][y],a[x-1][y],a[x][y+1],a[x][y-1],lc);
    }

    aa[x][y]=lc+1;
}
int dist(int x,int y,int x1,int y1){
   return abs(x-x1)+abs(y-y1);
}
int main(){

    ///freopen("test.txt","r",stdin);

    scanf("%d",&n);

    sito();

    int curr=0;
    for(int i=0;i<n;i++){
        rows[i*2]=primes[++curr];
       /// printf("%d %lld AA ROWS\n",i,primes[curr]);
    }
    for(int i=0;i<n;i++){
        cols[i*2]=primes[++curr];
       /// printf("%d %lld AA COLS\n",i,primes[curr]);
    }

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){

            if(dist(1,1,i,j)%2==0){
                a[i][j].pb(rows[dist(1,1,i,j)]);
                aa[i][j]=rows[dist(1,1,i,j)];
            }

        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){

            if(n%2){
               if(dist(n,1,i,j)%2==0){
                a[i][j].pb(cols[dist(n,1,i,j)]);
                aa[i][j]*=cols[dist(n,1,i,j)];
               }
            }
            else{
                if(dist(n,1,i,j)%2==1){
                    a[i][j].pb(cols[dist(n,1,i,j)-1]);
                    aa[i][j]*=cols[dist(n,1,i,j)-1];
                }
            }

        }
    }


    ///printf("%d %lld %lld %lld SUM\n",sum,cols[100],rows[100],cols[100]*rows[100]);

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if((i+j)%2){
                    fix(i,j);
                    printf("%lld ",aa[i][j]);
            }

            else printf("%lld ",aa[i][j]);
        }
        printf("\n");
    }



    ///check();

    return 0;
}
