#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
    for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;

    if(n == 2) {
        cout << "4 7\n23 10\n";
        return 0;
    }

    vector<ll> prime;
    for(ll i=2; prime.size()<2*n;++i) {
        bool flag = true;
        for(ll j=2; j*j<=i; ++j) {
            if(i%j==0) flag = false;
        }
        if(flag) prime.push_back(i);
    }

    // cout << prime << endl;

    bool turn = true;
    ll idx1 = 0, idx2 = 2*n-1;
    vector<vector<ll>> a(n, vector<ll>(n));
    for(ll sx=1; sx<n; sx+=2) {
        for(ll x=sx,y=0; x>=0&&y<n; x--,y++) {
            if(turn) a[y][x] = prime[idx1];
            else a[y][x] = prime[idx2];
        }
        if(turn) idx1++;
        else idx2--;
        turn = !turn;
    }
    for(ll sy=1+!(n%2); sy<n; sy+=2) {
        for(ll x=n-1,y=sy; x>=0&&y<n; x--,y++) {
            if(turn) a[y][x] = prime[idx1];
            else a[y][x] = prime[idx2];
        }
        if(turn) idx1++;
        else idx2--;
        turn = !turn;
    }
    // REP(i, n) cout << a[i] << endl;

    for(ll sx=n-1-n%2; sx>=0; sx-=2) {
        for(ll x=sx,y=0; x<n&&y<n; x++,y++) {
            if(turn) a[y][x] *= prime[idx1];
            else a[y][x] *= prime[idx2];
        }
        if(turn) idx1++;
        else idx2--;
        turn = !turn;
    }
    for(ll sy=1; sy<n; sy+=2) {
        for(ll x=0,y=sy; x<n&&y<n; x++,y++) {
            if(turn) a[y][x] *= prime[idx1];
            else a[y][x] *= prime[idx2];
        }
        if(turn) idx1++;
        else idx2--;
        turn = !turn;
    }

    // REP(i, n) cout << a[i] << endl;

    REP(i, n) REP(j, n) {
        if(a[i][j]) continue;
        ll t = 1;
        REP(k, 4) {
            ll nx = j + dx[k], ny = i + dy[k];
            if(!IN(0LL,n,nx) || !IN(0LL,n,ny)) continue;
            t = t / __gcd(t, a[ny][nx]) * a[ny][nx];
        }
        a[i][j] = t + 1;
    }


    REP(i, n) REP(j, n) {
        assert(a[i][j]<=1e15);
        cout << a[i][j] << (j==n-1?'\n':' ');
    }

    return 0;
}


Measured memory_bytes: 5120