#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 N=0;

struct loc{
    loc(){x=0;y=0;}
    loc(int i, int j){x=i;y=j;}
    bool addLegal(int a, int b, vector<loc>& arr, map<loc,int>& seen,loc& end, int d){

        if(addIfLegal(a,b,arr,seen,end,d))
            return true;
        if(addIfLegal(a,-b,arr,seen,end,d))
            return true;
        if(addIfLegal(-a,b,arr,seen,end,d))
            return true;
        if(addIfLegal(-a,-b,arr,seen,end,d))
            return true;
        if(a!=b){
            if(addIfLegal(b,a,arr,seen,end,d))
                return true;
            if(addIfLegal(-b,a,arr,seen,end,d))
                return true;
            if(addIfLegal(b,-a,arr,seen,end,d))
                return true;
            if(addIfLegal(-b,-a,arr,seen,end,d))
                return true;
        }
        return false;

    }
    loc(const loc& r, int a, int b){
        x=r.x+a;
        y=r.y+b;
    }
    bool addIfLegal(int a, int b, vector<loc>&arr ,map<loc,int>& seen,loc& end,int d){
        if((x+a)<N && (y+b)<N && (a+x)>=0 && (y+b)>=0){
            loc node(*this,a,b);
            if(node==end)
                return true;
            map<loc,int>::iterator it=seen.find(node);
            if(it==seen.end() || it->second>d){
                arr.push_back(node);
                seen[node]=d;

            }
        }
        return false;
    }
    void dump(){
           cout <<"Loc: "<<x<<" "<<y;
    }
    bool operator< (const loc& a) const{ return (x*N+y)< ((a.x)*N+a.y);}
    bool operator== (const loc& a) const{ return (a.x==x)&&(a.y==y);}
    int x;
    int y;
};
void dump(vector<loc>& a, string& s){
      for(int i=0;i<a.size();i++){
        cout <<s;
        a[i].dump();
        cout<<endl;
        }
}
void listMoves(loc& start, int x, int y, loc& end, map<loc,int>& seen, int d, int& ma, string s)
{
    d++;
    if(d>=ma)
        return;
    //    seen.insert(start);
    vector<loc> a;

    if(start.addLegal(x,y,a,seen,end,d)){
        if(d<ma)
            ma=d;
        return;
    }
    //    cout<<s<<d<<'.';
    // start.dump();
    //cout <<".  Found "<<a.size()<<" target."<<"  Seen: "<<seen.size()<<endl;
    // dump(a,s);
    s += "--";
    for(int i=0;i<a.size();i++)
    {
        listMoves(a[i],x,y,end,seen,d,ma,s);
    }

}
int main(){
    int n;
    cin >> n;
    // your code goes here
    N=n;


    loc end(n-1,n-1);

        for(int i=1;i<n;i++){
          for(int j=1;j<n;j++){
            int max = 1000000;
            map<loc,int> s;
            string x="";
            loc start;
            s[start]=0;
            listMoves(start,i,j,end,s,0,max,x);
            //  cout <<i<<','<<j<<':';
            if(max==1000000)
                cout<<-1<<" ";
            else
                cout <<max<<" ";
            }

        cout <<endl;
        }
    return 0;
}