#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;


set<pair<int,int> > next_movements(int n, int x, int y, int stepx, int stepy){
    set<pair<int,int> > s;
    if(x+stepx>=0 && x+stepx<n && y+stepy>=0 && y+stepy<n){
        s.insert(make_pair(x+stepx, y+stepy));
    }
    if(x+stepx>=0 && x+stepx<n && y-stepy>=0 && y-stepy<n){
        s.insert(make_pair(x+stepx,y-stepy));
    }
    if(x-stepx>=0 && x-stepx<n && y+stepy>=0 && y+stepy<n){
        s.insert(make_pair(x-stepx,y+stepy));
    }
    if(x-stepx>=0 && x-stepx<n && y-stepy>=0 && y-stepy<n){
        s.insert(make_pair(x-stepx,y-stepy));
    }
    if(x+stepy>=0 && x+stepy<n && y+stepx>=0 && y+stepx<n){
        s.insert(make_pair(x+stepy,y+stepx));
    }
    if(x+stepy>=0 && x+stepy<n && y-stepx>=0 && y-stepx<n){
        s.insert(make_pair(x+stepy,y-stepx));
    }
    if(x-stepy>=0 && x-stepy<n && y+stepx>=0 && y+stepx<n){
        s.insert(make_pair(x-stepy,y+stepx));
    }
    if(x-stepy>=0 && x-stepy<n && y-stepx>=0 && y-stepx<n){
        s.insert(make_pair(x-stepy,y-stepx));
    }
    return s;
}


int main(){
    int n;
    cin >> n;
    vector<vector<int> > solution(n, vector<int>(n));
    for(int i=1;i<n;i++){
        for(int j=i;j<n;j++){
            queue<pair<int,int> > q;
            set<pair<int,int> > seen;
            map<pair<int,int>, pair<int,int> > parent;
            q.push(pair<int, int>(0,0));
            while(!q.empty()){
                pair<int,int> node = q.front();
                q.pop();
                if(seen.find(node) !=seen.end())
                    continue;
                seen.insert(node);
                set<pair<int,int> > siblings = next_movements(n,node.first, node.second,i,j);
                for(set<pair<int,int> >::iterator it=siblings.begin();it!=siblings.end();it++){
                    if(seen.find(*it) == seen.end()){
                        q.push(*it);
                        parent[*it] = node;
                    }
                }
            }
            int counter = 1;
            if(seen.find(make_pair(n-1,n-1)) != seen.end()){
                pair<int,int> temp = parent[make_pair(n-1,n-1)];
                while(!(temp.first==0 && temp.second==0)){
                    temp= parent[make_pair(temp.first,temp.second)];
                    counter++;
                }
            }else{
                counter = -1;
            }
            solution[i-1][j-1] = counter;
            solution[j-1][i-1] = counter;
        }
    }
    for(int i=0;i<n-1;i++){
        for(int j=0;j<n-1;j++){
            cout<<solution[i][j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}