#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < (int)(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

int lcm(int a, int b) {
    return a / __gcd(a, b) * b;
}

int lcm(vi vec) {
    if (vec.empty())
        return 1;
    int ret = vec[0];
    for (int i = 1; i < SZ(vec); ++i)
        ret = lcm(ret, vec[i]);
    return ret;
}

vi di = {0, 0, -1, 1};
vi dj = {-1, 1, 0, 0};
const int N = 1e5 + 10;
int ptr[N];
int n;
vvi g;
vi ans;
void dfs(int v) {
    for (; ptr[v] < n; ++ptr[v]) {
        int to = ptr[v];
        if (to != v && !g[v][to]) {
            g[v][to] = g[to][v] = true;
            dfs(to);
        }
    }
    ans.push_back(v);
}

vi get(int sz) {
    int N = 1e5 + 10;
    vector<bool> prime(N, true);
    vi primes;
    for (int i = 2; i < N; ++i) {
        if (prime[i]) {
            primes.push_back(i);
            int x = SZ(primes);
            if (x * (x - 1) / 2 > sz)
                break;
            for (int j = i * i; j < N; j += i) {
                prime[j] = false;
            }
        }
    }


    n = primes.size();
    g.resize(n);
    fori (i, n) {
        g[i].resize(n);
    }
    dfs(0);
    vi ret(sz);
    for (int i = 0; i < sz; ++i) {
        ret[i] = primes[ans[i]] * primes[ans[i + 1]];
    }
    watch(*max_element(ALL(primes)));
    return ret;
}

bool is_prime(int n) {
    for (int i = 2; i * i <= n; ++i)
        if (n % i == 0)
            return false;
    return true;
}

void smain() {
    int n;
    cin >> n;
    vvl a(n, vl(n, 0));
    set<int> used;
    map<int, vector<pii>> diags;
    fori (i, n) {
        fori (j, n) {
            if (((i ^ j) & 1)) {
                diags[i + j].push_back({i, j});
            }
        }
    }

    vi kek;
    int cur = n * 5 + 1;
    while (!is_prime(cur))
        cur++;
    int curkek = 1;
    for (auto item : diags) {
        sort(ALL(item.second), [&] (const pii & f, const pii & s) -> bool {
            return f.second < s.second;
        });
        int s = kek.size();
        if (s < item.second.size()) {
            curkek++;
            while (!is_prime(curkek))
                curkek++;
            kek.push_back(curkek);

            curkek++;
            while (!is_prime(curkek))
                curkek++;
            kek.insert(kek.begin(), curkek);
        } else if (s > item.second.size()) {
            kek.erase(kek.begin());
            kek.pop_back();
        }
        fori (i, SZ(kek)) {
            a[item.second[i].first][item.second[i].second] = kek[i] * cur - 1;
        }
        cur++;
        while (!is_prime(cur))
            cur++;
    }

    fori (i, n) {
        fori (j, n) if (a[i][j] == 0 ) {
            vi vec;

            fori (dir, SZ(di)) {
                int ii = i + di[dir];
                int jj = j + dj[dir];
                if (ii >= 0 && ii < n && jj >= 0 && jj < n) {
                    vec.push_back(a[ii][jj] + 1);
                }
            }
            int x = lcm(vec);
            ll cur = x;
            while (used.count(cur))
                cur += x;
            a[i][j] = cur;
            used.insert(a[i][j]);
        }
    }

    ll mx = 0;
    set<int> unq;
    fori (i, n) {
        fori (j, n) {
            cerr << a[i][j] << "   ";
            inmax(mx, a[i][j]);
            cout << a[i][j] * 2 + 2 << ' ';
            assert(a[i][j] * 2 + 2 <= 1000000000000000L);
//            if (unq.count(a[i][j] * 2 + 2)) {
//                watch(i);
//                watch(j);
//            }
            unq.insert(a[i][j] * 2 + 2);
        }
        cout << '\n';
    }
    assert(unq.size() == n * n);
    watch(mx);
    watch(lcm({11, 22, 12, 24}));
}

Measured memory_bytes: 25344