#include <bits/stdc++.h>

using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;


int main(){
  int N;
  cin>>N;
  int ans[501][501] = {0},ans2[501][501] = {0};
  for(int i(1);i<=N;i++){
    for(int j(1);j<=N;j++){
      if(j - i+1 <= 0) ans[i][j] = j-i+N+1;
      else ans[i][j] = j-i+1;
      //ans[i][j] = (j-i)
    }
  }
  int retu[501] = {0};
  for(int i(0);i<N/2+1;i++){
    retu[i*2+1] = i+1;
  }
  for(int i(1);i<=N/2;i++){
    retu[i*2]=N/2+1+i; 
  }
  // cout << endl;
  // for(int i(1);i<=N;i++){
  //   cout << retu[i] << " ";
  // }
  // cout << endl;
  // cout << endl;
  for(int i(1);i<=N;i++){
    for(int j(1);j<=N;j++){
      ans2[j][retu[i]] = ans[j][i];
    }
  }
  for(int i(1);i<=N;i++){
    for(int j(1);j<=N;j++){
      if(j != N) cout << ans2[i][j] << " ";
      else cout << ans2[i][j];
    }
    cout << endl;
  }
  return 0;
}