#include<bits/stdc++.h>
using namespace std;

int main() {
  vector<bool> furui(5001,true);
  int j;
  for (int i=2; i<100; i++) {
    j = 2;
    while (i * j <= 5000) {
      furui[i*j] = false;
      j++;
    }
  }
  
  vector<long long> prime(500);
  long long now = 500;
    
  for (int i=0; i<500; i++) {
    while (!furui[now]) {
      now++;
    }
    prime[i] = now;
    now++;
  }
  
  vector<vector<long long>> ans(500,vector<long long>(500,0));
  
  for (int i=0; i<500; i++) {
    for (int j=0; j<500; j++) {
      if ((i+j)%2 == 1) {
        ans[i][j] = prime[(i-j+499)/2];
        ans[i][j] *= ((i+j+1)/2);
      }
    }
  }
  
  ans[0][0] = ans[0][1] * ans[1][0] + 1;
  ans[499][499] = ans[499][498] * ans[498][499] + 1;
  
  for (int i=0; i<500; i++) {
    for (int j=0; j<500; j++) {
      if (ans[i][j] == 0) {
        if (i == 0 || i == 499) {
          ans[i][j] = ans[i][j-1] * ans[i][j+1] + 1;
        }
        else {
          ans[i][j] = ans[i+1][j] * ans[i-1][j] + 1;
        }
      }
    }
  }
  
  
  int N;
  cin >> N;
  for (int i=0; i<N; i++) {
    for (int j=0; j<N; j++) {
      cout << ans[i][j];
      if (j != N-1) {
        cout << " ";
      }
    }
    cout << endl;
  }
}
