#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;

int vis[25][25];
int mod[2] = {1, -1};
int mov[8][2];
int ans[25][25];

struct Position {
    int x, y;
};

int main(){
    int n;
    cin >> n;
    for (int i=1; i<n; ++i) {
        for (int j=i; j<n; ++j) {
            for (int k=0; k<2; ++k) {
                mov[k*4+0][0] = i*mod[k]; mov[k*4+0][1] = j;
                mov[k*4+1][0] = i*mod[k]; mov[k*4+1][1] = -j;
                mov[k*4+2][0] = j*mod[k]; mov[k*4+2][1] = i;
                mov[k*4+3][0] = j*mod[k]; mov[k*4+3][1] = -i;
            }
            memset(vis, 0x7f, sizeof(vis));
            vis[0][0] = 0;
            Position cur = {0, 0}, tmp;
            queue<Position> q;
            q.push(cur);
            while (!q.empty()) {
                cur = q.front();
                q.pop();
                for (int i=0; i<8; ++i) {
                    tmp.x = cur.x + mov[i][0];
                    tmp.y = cur.y + mov[i][1];
                    if (tmp.x < 0 || tmp.x >= n ||
                       tmp.y < 0 || tmp.y >= n ||
                       vis[cur.x][cur.y] + 1 >= vis[tmp.x][tmp.y]) {
                        continue;
                    }
                    
                    vis[tmp.x][tmp.y] = vis[cur.x][cur.y] + 1;
                    q.push(tmp);
                }
            }
            
            ans[i][j] = ans[j][i] = vis[n-1][n-1] > 100 ? -1 : vis[n-1][n-1];
        }
    }
    
    for (int i=1; i<n; ++i) {
        for (int j=1; j<n; ++j) {
            cout << ans[i][j] << ((j == n-1) ? "\n" : " ");
        }
    }
    return 0;
}