#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const int N = 2e4 + 5;
int sito[N];
int nww(int a, int b) {
  if (a == 0) { return b; }
  if (b == 0) { return a; }
  int g = __gcd(a, b);
  return a / g * b;
}
int Good(int a, int b) {
  if (a > b) { swap(a, b); }
  return (b % a == 1);
}
int a[505][505];
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  

  int n;
  cin>>n;
  vector<int> lp;
  for (int i = 2; i < N; i++) {
    if (sito[i] == 0) {
      lp.PB(i);
      for (int j = 1; i * j < N; j++) {
        sito[i * j] = 1;
      }
    }
  }
  debug(SZ(lp));
  debug(lp[499]);
  RE (i, n) {
    RE (j, n) {
      if (i % 2 == j % 2) {
        a[i][j] = lp[(i - j) / 2 + 750] * lp[(i + j) / 2];
      }
    }
  }
  RE (i, n) {
    RE (j, n) {
      if (i % 2 != j % 2) {
        int mult = 1;
        if (i == 1 && j == 2) {
          mult = 2;
        }
        a[i][j] = nww(a[i + 1][j], nww(a[i - 1][j], nww(a[i][j + 1], a[i][j - 1]))) * mult + 1;
      }
      cout<<a[i][j]<<" ";
    }
    cout<<endl;
  }
  set<int> lols;
  int ma = 0;
  RE (i, n) {
    RE (j, n) {
      lols.insert(a[i][j]);
      assert(a[i][j] <= 1e15);
      maxi(ma, a[i][j]);
    }
  }
  debug(ma);
  debug(n * n, SZ(lols));
  assert(SZ(lols) == n * n);
  RE (i, n) {
    RE (j, n - 1) {
      assert(Good(a[i][j], a[i][j + 1]));
    }
  }
  RE (i, n - 1) {
    RE (j, n) {
      assert(Good(a[i][j], a[i + 1][j]));
    }
  }
//   RE (i, n) {
//     RE (j, m) {
//       if (i % 2 == j % 2) {
//         a[i][j] = 
//     }
//   }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 17024