#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int N;
  cin>>N;
  int ans[N][N];
  for(int i=0;i<N;++i) {
    for(int j=0;j<N;++j) {
      if((i+j)%2==0) {
        ans[i][j] = (i+j+2)/2;
      }
      else {
        if(i+j>N) ans[i][j] = (i+j-N+2)/2;
        else ans[i][j] = (i+j+N+2)/2;
      }
    }
  }
  for(int i=0;i<N;++i) {
    for(int j=0;j<N;++j) {
      cout<<ans[i][j]<<" ";
    }
    cout<<endl;
  }
}