const int N = 400005;
const int LG = 21;
const int MOD = 1e9 + 7;
const int INF = 1e9;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(N);
    __ufact.resize(N);
    __rev.resize(N);
    __rev[1] = 1;
    for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int n;

int not_prime(int x)
{
    for (int i = 2; i < x; i++) if (x % i == 0) return 1;
    return 0;
}

int ok(int i, int j)
{
    return (0 <= i && i < 500 && 0 <= j && j < 500);
}

vector<ll> nums[600][600];

signed main()
{
    srand(time(NULL));
    #ifdef ONLINE_JUDGE
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
    #endif // ONLINE_JUDGE
    cin >> n;
    int p = 2;
    for (int si = 1; si <= 1000; si += 2)
    {
        while (not_prime(p)) p++;
        for (int i = 0; i <= 500; i++)
        {
            for (int j = 0; j <= 500; j++)
            {
                if (i + j == si)
                {
                    nums[i][j].push_back(p);
                }
            }
        }
        p++;
    }
    for (int dif = -499; dif <= 499; dif += 2)
    {
        while (not_prime(p)) p++;
        for (int i = 0; i <= 500; i++)
        {
            for (int j = 0; j <= 500; j++)
            {
                if (i - j == dif)
                {
                    nums[i][j].push_back(p);
                }
            }
        }
        p++;
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (i % 2 != j % 2)
            {
                ll k = 1;
                for (auto e : nums[i][j]) k *= e;
                cout << k << " ";
            }
            else
            {
                vector<ll> p;
                for (int k = 0; k < 4; k++)
                {
                    if (ok(i + cx[k], j + cy[k]))
                    {
                        p.push_back(nums[i + cx[k]][j + cy[k]][0]);
                        p.push_back(nums[i + cx[k]][j + cy[k]][1]);
                    }
                }
                uniq(p);
                ll k = 1;
                for (auto e : p) k *= e;
                cout << k + 1 << " ";
            }
        }
        cout << "\n";
    }
}

/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Check corner cases.
No def int long long for now.
*/


Measured memory_bytes: 15488