#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

#define pp pair<int,int>
#define ppp pair<pp,int>
int n;
bool fr[26][26];
bool check(int u, int v)
{
    if ((u<0)||(v<0)||(u>=n) || (v>=n) || (!fr[u][v])) return false;
    return true;
}
int KNight(int u, int v) {
    queue<ppp> e;

    for (int i = 0; i<n; i++) for (int j = 0; j<n; j++) fr[i][j] = true;
    e.push(ppp(pp(0,0),0));
    fr[0][0] = false;
    ppp tmp;
    while (!e.empty()) {
        tmp = e.front();
        e.pop();
        pp tt = tmp.first;
        int pos_u = tt.first;
        int pos_v = tt.second;
        if ((pos_u == n-1)&&(pos_v == n-1)) return tmp.second;
        //
        if (check(pos_u + u,pos_v + v)) {
            fr[pos_u + u][pos_v + v] = false;
            e.push(ppp(pp(pos_u+u,pos_v+v),tmp.second+1));
        }
        if (check(pos_u + v,pos_v + u)) {
            fr[pos_u + v][pos_v + u] = false;
            e.push(ppp(pp(pos_u+v,pos_v+u),tmp.second+1));
        }
        if (check(pos_u - u,pos_v - v)) {
            fr[pos_u - u][pos_v - v] = false;
            e.push(ppp(pp(pos_u-u,pos_v-v),tmp.second+1));
        }
        if (check(pos_u - v,pos_v - u)) {
            fr[pos_u - v][pos_v - u] = false;
            e.push(ppp(pp(pos_u-v,pos_v-u),tmp.second+1));
        }

        if (check(pos_u + u,pos_v - v)) {
            fr[pos_u + u][pos_v - v] = false;
            e.push(ppp(pp(pos_u+u,pos_v-v),tmp.second+1));
        }
        if (check(pos_u - v,pos_v + u)) {
            fr[pos_u - v][pos_v + u] = false;
            e.push(ppp(pp(pos_u-v,pos_v+u),tmp.second+1));
        }
        if (check(pos_u - u,pos_v + v)) {
            fr[pos_u - u][pos_v + v] = false;
            e.push(ppp(pp(pos_u-u,pos_v+v),tmp.second+1));
        }
        if (check(pos_u + v,pos_v - u)) {
            fr[pos_u + v][pos_v - u] = false;
            e.push(ppp(pp(pos_u+v,pos_v-u),tmp.second+1));
        }
    }
    return -1;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
   // int n;
    cin>>n;
    int f[26][26];
    for (int i = 1; i<n; i++)
        for (int j = i; j<n; j++) {
        f[i][j] = KNight(i,j);
        f[j][i] = f[i][j];
    }
    for (int i = 1; i<n; i++) {
        for (int j = 1; j<n; j++) cout << f[i][j] << ' ';
        cout << endl;
    }
    return 0;
}