#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 <utility>
#define ff first
#define ss second
#define mpa make_pair

using namespace std;

pair<int, int> p1;

bool check(int i, int j, int n)
{
    if( (i<0) || (i>=n) || (j<0) || (j>=n) )
        return false;
    return true;
}

int bfs(pair<int, int> p1, int i, int j, int n) 
{
    queue< pair<pair<int, int>, int> > Q;
    map<pair<int, int>, bool> Board;
         
    Q.push(mpa(p1, 0));
 
    while(!Q.empty()) {
     
        pair<pair<int, int>, int> temp = Q.front();
        Q.pop();
 
        if(temp.ff.ff == n-1 && temp.ff.ss == n-1)
                return temp.ss;
        int x = temp.ff.ff;
        int y = temp.ff.ss;
        int distance = temp.ss + 1;
 
 
        if(Board.count(mpa(x, y)))
            continue;
        Board[mpa(x, y)] = true;
 
        if( check(x + i, y + j, n) )
            Q.push(mpa(mpa(x + i, y + j), distance));
        if( check(x + i, y - j, n) )
            Q.push(mpa(mpa(x + i, y - j), distance));
        if( check(x - i, y + j, n) )
            Q.push(mpa(mpa(x - i, y + j), distance));
        if( check(x - i, y - j, n) )
            Q.push(mpa(mpa(x - i, y - j), distance));
        if( check(x + j, y + i, n) )
            Q.push(mpa(mpa(x + j, y + i), distance));
        if( check(x + j, y - i, n) )
            Q.push(mpa(mpa(x + j, y - i), distance));
        if( check(x - j, y + i, n) )
            Q.push(mpa(mpa(x - j, y + i), distance));
        if( check(x - j, y - i, n) )
            Q.push(mpa(mpa(x - j, y - i), distance));
 
    }
 
    return -1;
}

int main(){
    int n;
    cin >> n;
    
    int ans[n][n] = {0};
    p1.ff = 0;
    p1.ss = 0;
    
    for(int i=0; i<n-1; i++)
    {    
        for(int j=0; j<=i; j++)
        {
            ans[i][j] = bfs(p1,i+1,j+1,n);
            ans[j][i] = ans[i][j];
        }
    }
    
    for(int i=0; i<n-1; i++)
    {
        for(int j=0; j<n-1; j++)
            cout<<ans[i][j]<<" ";
        cout<<endl;
    }
    
    return 0;
}