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

map<pair<int,int>, list<pair<int,int>>> graph; //initialize to zero
map<pair<int,int>, int> explored; //intialize to zero
queue<pair<int,int>> q; //intialize to empty
map<pair<int,int>, int> mydistance; //intialize to infinity

void BFS(pair<int,int> s)
    {
    q.push(s);
    mydistance[s] = 0;
    explored[s] = 1;
    while(!q.empty())
        {
        pair<int,int> u = q.front();
        q.pop();
        for (list<pair<int,int>>::iterator it = graph[u].begin(); it != graph[u].end(); ++it)
            {
            if (!explored[*it])
                {
                q.push(*it);
                explored[*it]=1;
                mydistance[*it]=mydistance[u]+1;     
            }           
        }       
    }   
}

// undirected graph so minimun distance is given by BFS
int main(){
    int n;
    cin >> n;
    // your code goes here
    vector<vector<int>> res(n+1, vector<int>(n+1, -1));
    
    for (int i=1; i<n; i++)
        {
        for (int j=i; j<n; j++)
            {
            // initialize all parameters
            graph.clear();
            explored.clear();
            q = queue<pair<int,int>>(); 
            mydistance.clear();
            // constructing the graph
            for (int row=0; row<n; row++)
                {
                for(int column=0; column<n; column++)
                    {
                    graph[make_pair(row,column)] = list<pair<int,int>>();
                    //graph.insert(make_pair(row,column), list<pair<int,int>>()); // inserting the position in the graph
                   // explored.insert(make_pair(row,column));
                    explored[make_pair(row,column)] = 0;
                    //mydistance.insert(make_pair(row,column));
                    mydistance[make_pair(row,column)] = +1000;  
                    // inserting edges
                    if ( (row+i)<n && (column+j)<n )
                        (graph[make_pair(row,column)]).push_back(make_pair(row+i, column+j));
                    if ( (row-i)>=0 && (column+j)<n )
                        graph[make_pair(row,column)].push_back(make_pair(row-i, column+j));
                    if ( (row+i)<n && (column-j)>=0 )
                        graph[make_pair(row,column)].push_back(make_pair(row+i, column-j));
                    if ( (row-i)>=0 && (column-j)>=0 )
                        graph[make_pair(row,column)].push_back(make_pair(row-i, column-j));
                    
                    if (i != j)
                        {
                        if ( (row+j)<n && (column+i)<n )
                            (graph[make_pair(row,column)]).push_back(make_pair(row+j, column+i));
                        if ( (row-j)>=0 && (column+i)<n )
                            graph[make_pair(row,column)].push_back(make_pair(row-j, column+i));
                        if ( (row+j)<n && (column-i)>=0 )
                            graph[make_pair(row,column)].push_back(make_pair(row+j, column-i));
                        if ( (row-j)>=0 && (column-i)>=0 )
                            graph[make_pair(row,column)].push_back(make_pair(row-j, column-i));
                    }
                }//end column loop
                
            }// end row loop
            BFS(make_pair(0,0));
            int result = mydistance[make_pair(n-1,n-1)];
            if (result != 1000)
                res[i][j] = result;
            
                       
        }
        
        
    }
    
    
    for (int i=1; i<n; i++)
        {
        for (int j=1; j<n; j++)
            {
            int d;
            d = (j >= i)? res[i][j]:res[j][i];
            cout <<d<<" ";
            
        }
        cout <<endl;
    }
    return 0;
}