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

class Node{
    public:
    int x;
    int y;
    Node(int xx,int yy){x=xx;y=yy;}
};

bool is_in(int xx,int yy,int n){
    if(xx<n && yy<n &&xx>=0 &&yy>=0) return true;
    else return false;
}

void com(vector<vector<int> > &arr,list<Node> &lt,int a,int b,int n){
    int x=lt.front().x;
    int y=lt.front().y;
    int xarr[8]={x+a,x+a,x-a,x-a,x+b,x+b,x-b,x-b};
    int yarr[8]={y+b,y-b,y+b,y-b,y+a,y-a,y+a,y-a};
    for(int i=0;i<8;i++){
        //cout<<i<<endl;
        if(is_in(xarr[i],yarr[i],n) && arr[xarr[i]][yarr[i]]==-1){
//            cout<<xarr[i]<<","<<yarr[i]<<" will be added! "<<endl;
            arr[xarr[i]][yarr[i]]=arr[x][y]+1;
            Node t(xarr[i],yarr[i]);
//            cout<<t.x<<","<<t.y<<" is generated!"<<endl;
            lt.push_back(t);
        }
        
    }
/*    for(auto a:lt){
        cout<<a.x<<" "<<a.y<<"| ";
    }
    cout<<endl;
    */
    lt.pop_front();
}

int main(){
    int n;
    cin >> n;
    for(int a=1;a<n;a++){
        for(int b=1;b<n;b++){
            vector< vector< int > > arr(n,vector<int>(n,-1));
            list<Node> lt;
            arr[0][0]=0;
            Node t(0,0);
            lt.push_back(t);
 //           printf("\n(%d,%d)\n",a,b);
            while(lt.begin()!=lt.end()){
                com(arr,lt,a,b,n);
            }
        cout<<arr[n-1][n-1]<<" ";
        }
        cout<<endl;
    }
    // your code goes here
    return 0;
}