#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>

using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
using lint=long long;
typedef pair<int,int> P;
const int inf=1000000007;
const int MOD=1000000007;
signed main(){
  int n;cin>>n;
  vector<vector<int>> a(n+1,vector<int>(n+1,0));
  rep1(i,n){
    int x=0;int y=(2*i-2)%n;
    rep1(j,n){
      a[y][x]=i;
      ++x;x%=n;
      y+=n-1;y%=n;
    }
  }
  rep(i,n){
    rep(j,n){
      cout<<a[i][j]<<" ";
    }
    cout<<endl;
  }
  return 0;
}