#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  
  vector<vector<int>> A(N,vector<int>(N,0));
  int M=N/2+1;
  rep(i,N) rep(j,N){
    if((i+j)%2==0) A[i][j]=(i+j)/2+1;
    else{
      if(i+j>=N) A[i][j]=(i+j-N)/2+1;
      else A[i][j]=(i+j+1)/2+M;
    }
  }

  rep(i,N){
    rep(j,N) cout<<A[i][j]<<" ";
    cout<<"\n";
  }

  return 0;
}