#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__

int main() {
    int N; cin >> N;

    vector<vi> G(N, vi(N));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            G[i][(j + i) % N] = j;
        }
    }


    for (int x = 1; x < N; x++) {

// xが2の時、Gのうち2行目の値が2の列を見つける
        int target_column;
        for (int column = x; column < N; column++) {
            if (G[x][column] == x) {
                target_column = column;
                break;
            }
        }

        for (int i = 0; i < N; i++) {
            swap(G[i][x], G[i][target_column]);
        }
    }

    rep(i, N) {
        rep(j, N) {
            cout << (G[i][j] + 1);

            if (j != N - 1) cout << " ";
        }
        cout << endl;
    }


}