#include<bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ios\
    ios::sync_with_stdio(false);\
    cin.tie(nullptr);
#define VEC(type, name, size)\
    V<type> name(size);\
    IN(name)
#define VVEC(type, name, h, w)\
    VV<type> name(h, V<type>(w));\
    IN(name)
#define INT(...)\
    int __VA_ARGS__;\
    IN(__VA_ARGS__)
#define LL(...)\
    ll __VA_ARGS__;\
    IN(__VA_ARGS__)
#define STR(...)\
    string __VA_ARGS__;\
    IN(__VA_ARGS__)
#define CHAR(...)\
    char __VA_ARGS__;\
    IN(__VA_ARGS__)
#define DOUBLE(...)\
    DOUBLE __VA_ARGS__;\
    IN(__VA_ARGS__)
#define LD(...)\
    LD __VA_ARGS__;\
    IN(__VA_ARGS__)
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &a) { for(auto &i : a) scan(i); }
template <class T, class L> void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); }
template <class T> inline void print(T x){ cout << x << '\n';}
#define ll long long
#define ld long double
#define FOR(i,l,r) for(ll i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(ll i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; }
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; }
inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';}
inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';}
inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}}
template<class T> inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}}
template<class T> T Roundup_div(T x, T y) {return (x+(y-1))/y;}
template <typename T> T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; }
const ll INF = 1e18;
#pragma endregion

int N = 500;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
inline bool inside(int x, int y) {return x >= 0 and x < N and y >= 0 and y < N;}

V<> prime;
vector<bool> ip(10010, true);
void er(){
    ip[0] = ip[1] = 0;
    for(int i = 2; i <= 10000; i++) if(ip[i]) for(int j = 2 * i; j <= 10000; j += i) ip[j] = false;
    for(int i = 2; i <= 10000; i++) if(ip[i]) prime.pb(i);
}

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

int main(){
    ios;
    er();
    INT(n);
    VV<> res(N, V<>(N, 1));
    REP(i, N) REP(j, N) if(!((i + j) % 2)) res[i][j] = prime[(i + j) / 2];
    map<ll,ll> exi;
    REP(i, N / 2){
        int x = 0, y = i * 2;
        while(x < N and y < N){
            res[x][y] *= prime[i];
            exi[res[x][y]]++;
            x++; y++;
        }
    }
    REP(i, N / 2 - 1){
        int x = i * 2 + 2, y = 0;
        while(x < N and y < N){
            res[x][y] *= prime[N - i - 1];
            exi[res[x][y]]++;
            x++; y++;
        } 
    }
    REP(i, N) REP(j, N){
        if(((i + j) % 2)){
            REP(k, 4){
                int nx = i + dx[k], ny = j + dy[k];
                if(inside(nx, ny)) res[i][j] = lcm(res[i][j], res[nx][ny]);
            }
        }
    }
    REP(i, N) REP(j, N) if(((i + j) % 2)){
        ll t = res[i][j];
        res[i][j]++;
        while(exi[res[i][j]]) res[i][j] += t;
        exi[res[i][j]]++;
    }
    REP(i, n){  
        REP(j, n) cout << res[i][j] << " "; cout << endl;
    }
}

Measured memory_bytes: 21244