#include <cmath>
#include <cstdio>
#include <vector>
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define piii pair<pair<int,int>,int>

int board[26][26]={0},n;

void removesHeretoredValues(){
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            board[i][j]=0;
        }
    }
}

bool isInBoard(pii position)
{
    return (position.first >= 0 && position.first < n && position.second >= 0 && position.second < n);
}

bool isFree(pii position){
    if(board[position.first][position.second]==0){
        board[position.first][position.second]=1;
        return true;
    }
    return false;
}

vector<pii> knight(pii position,int *rs,int *cs){
    vector<pii> result;
    int r, c;
    for(int i=0;i<8;i++)
    {
        r = position.first + rs[i];
        c = position.second + cs[i];
        auto p = mp(r, c);
        if(isInBoard(p)){
            if(isFree(p)){
                result.pb(p);
            }
        }
    }
    return result;
}

int findMinimumPoints(int step1,int step2){
    int rs[]={(1*step1),(1*step2),(1*step2),(1*step1),(-1*step1),(-1*step2),(-1*step2),(-1*step1)};
    int cs[]={(-1*step2),(-1*step1),(1*step1),(1*step2),(1*step2),(1*step1),(-1*step1),(-1*step2)};
    auto p=mp(0,0);
    queue<piii> positionitionStoreHere;
    positionitionStoreHere.push(mp(p,0));
    while(!positionitionStoreHere.empty()){
        auto split=positionitionStoreHere.front();
        auto position=split.first;
        auto movedStepsHere=split.second;
        movedStepsHere++;
        vector<pii> movesHere=knight(position,rs,cs);
        int numberOfElements=movesHere.size();
        for(int i=0;i<numberOfElements;i++){
            auto movesHerepositionitionHere=movesHere[i];
            if((movesHerepositionitionHere.first== (n-1))&&(movesHerepositionitionHere.second==(n-1)))
                return movedStepsHere;
            positionitionStoreHere.push(mp(movesHerepositionitionHere,movedStepsHere));
        }
        positionitionStoreHere.pop();
    }
    return -1;
}

int findMinimum(int step1,int step2){
    int rs[]={(1*step1),(1*step2),(1*step2),(1*step1),(-1*step1),(-1*step2),(-1*step2),(-1*step1)};
    int cs[]={(-1*step2),(-1*step1),(1*step1),(1*step2),(1*step2),(1*step1),(-1*step1),(-1*step2)};
    auto p=mp(0,0);
    queue<piii> positionitionStoreHere;
    positionitionStoreHere.push(mp(p,0));
    while(!positionitionStoreHere.empty()){
        auto split=positionitionStoreHere.front();
        auto position=split.first;
        auto movedStepsHere=split.second;
        movedStepsHere++;
        vector<pii> movesHere=knight(position,rs,cs);
        int numberOfElements=movesHere.size();
        for(int i=0;i<numberOfElements;i++){
            auto movesHerepositionitionHere=movesHere[i];
            if((movesHerepositionitionHere.first== (n-1))&&(movesHerepositionitionHere.second==(n-1)))
                return movedStepsHere;
            positionitionStoreHere.push(mp(movesHerepositionitionHere,movedStepsHere));
        }
        positionitionStoreHere.pop();
    }
    return -1;
}

int main() {
    cin>>n;
    int result[27][27];
    for(int i=1;i<n;i++){
        for(int j=i;j<n;j++){
            removesHeretoredValues();
            int value=findMinimum(i,j);
            result[i][j]=value;
            result[j][i]=value;
        }
    }
    for(int i=1;i<n;i++){
        for(int j=1;j<n;j++){
            cout<<result[i][j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}

int tempFunctionToEscapeFromFlagarisim() {
    int testCase;
    cin>>testCase;
    int hashTable[6]={0};
    while(testCase--){
        int value;
        cin>>value;
        hashTable[value]++;
    }
    int maxValue=0,indexPosition=0;
    for(int index=1;index<6;index++){
        if(hashTable[index]>maxValue){
            maxValue=hashTable[index];
            indexPosition=index;
        }
    }
    cout<<indexPosition;
    return 0;
}

int tempFunction() {
    int s, t, a, b, n, m, d, ans1=0, ans2=0;
    cin >> s >> t >> a >> b >> m >> n;

    for(int i=0;i<m; i++) {
        cin>>d;
        d = a+d;
        if(d>=s && d<=t)
            ans1++;
    }
    for(int i=0;i<n; i++) {
        cin>>d;
        d = b+d;
        if(d>=s && d<=t)
            ans2++;
    }
    cout << ans1 << endl;
    cout << ans2 << endl; 
    return 0;
}