#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(ll i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';

const int mx=100010;
const ll mod=1e9+7;


int main(){
  int n;
  cin >> n;
  vector<vector<int>> d(n, vector<int>(n));
  rep(j,n){
    for(int i=n; i>0; i--){
      int tmp = i-j;
      if(tmp<=0) tmp += n;
      d[j][n-i] = tmp;
    }
  }

  REP(k,1,n+1){
    rep(j,n){
      if(d[j][k-1] == k){
        for(auto it:d[j]){
          cout << it << " ";
        }
        cout << ln;
        break;
      }
    }
  }
  return 0;
}