#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>
using namespace std;

#define MAXD                 8
#define MAXN                 25
#define SIZE                     625
#define queue_init           (head=tail=0)
#define queue_is_empty  (head==tail)
#define en_queue(x)         (squeue[tail++]=(x))
#define de_queue             (squeue[head++])
#define rint                       register int

typedef struct point {
    int x,y;
} point;

int N,sx,sy,ex,ey,head,tail;
int matrix[MAXN][MAXN];
int Ans[MAXN][MAXN];
int dx[MAXD],dy[MAXD];
struct point squeue[SIZE];
int d[2]={1,-1};

void dump()
{
    for (rint i=0;i<N;++i) {
        for (rint j=0;j<N;++j)
            cout<<matrix[i][j]<<" ";
        cout<<endl;
    }
    cout<<endl;
}    

void generate_dist(int a,int b)
{
    register int k=0;
    for (rint i=0;i<2;++i) {
        for (rint j=0;j<2;++j) {
            dx[k]=a*d[i];
            dy[k]=b*d[j];
            ++k;
        }
    }
    for (rint i=0;i<2;++i) {
        for (rint j=0;j<2;++j) {
            dx[k]=b*d[i];
            dy[k]=a*d[j];
            ++k;
        }
    }
}    

int solve(int a,int b)
{
    struct point in,out;queue_init;
    generate_dist(a,b);
    memset(matrix,-1,sizeof(matrix));
    matrix[in.x=sx][in.y=sy]=0;en_queue(in);
    while (!queue_is_empty) {
        out=de_queue;
        if (out.x==ex && out.y==ey) return matrix[ex][ey];
        for (rint k=0;k<8;++k) {
            rint i=out.x+dx[k],j=out.y+dy[k];
            if (i<0 || i>=N || j<0 || j>=N || matrix[i][j]>=0) continue;
            matrix[in.x=i][in.y=j]=matrix[out.x][out.y]+1;
            en_queue(in);
        }
    }
    return -1;
}

int main(){
    cin>>N;
    sx=sy=0;ex=ey=N-1;
    for (rint i=1;i<N;++i) {
        for (rint j=i;j<N;++j) {
           Ans[i][j]=Ans[j][i]=solve(i,j); 
        }
    }
    for (rint i=1;i<N;++i) {
        for (rint j=1;j<N;++j)
            cout<<Ans[i][j]<<" ";
        cout<<endl;
    }
    return 0;
}