#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;


int main(){
    int n; cin >> n;
    vector<vector<int>> ans(n,vector<int>(n));
    rep(i,n) ans[i][i] = i+1;
    vector<int> v(2*n);
    rep(i,n){
        v[i] = i+1;
        v[i+n] = v[i];
    }
    rep(i,n){
        rep(j,n){
            if(j == (i+1)%n){
                repr(k,i+1,i+n){
                    ans[i][k%n] = v[i+n-(k-i)];
                }
                break;
            }
        }
    }
    rep(i,n){
        rep(j,n){
            cout << ans[i][j] << " ";
        }
        cout << endl;
    }

}