import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int [][] minMoves ;
    //static int [][] op ;
    static boolean[][] visited ;
    static int nodesVisited =0;
    static int n;
    
    public static void visit(int x, int y, int dx, int dy, int moves){
        visited[x][y]=true;
        minMoves [x][y]= moves;
        
                //System.out.println(x+"x y"+y+" moves"+moves);
        if(x==0&&y==0)
            return;
        if(visited[0][0] && moves>=minMoves[0][0])
            return;
        int mxx = x-dx;
        int mxy =x-dy;
        int pxx = x+dx;
        int pxy = x+dy;
        int myx = y-dx;
        int myy =y-dy;
        int pyx=y+dx;
        int pyy=y+dy;
        if(pxx<n){
            if(pyy<n){
                if(!visited[pxx][pyy]||moves+1<minMoves[pxx][pyy]) visit(pxx,pyy,dx,dy,moves+1);
            }
            if(myy>-1){
                if(!visited[pxx][myy]||moves+1<minMoves[pxx][myy]) visit(pxx,myy,dx,dy,moves+1);
            }
        }
        if(mxx>-1){
            if(pyy<n){
                if(!visited[mxx][pyy]||moves+1<minMoves[mxx][pyy]) visit(mxx,pyy,dx,dy,moves+1);
            }
            if(myy>-1){
                if(!visited[mxx][myy]||moves+1<minMoves[mxx][myy]) visit(mxx,myy,dx,dy,moves+1);
            }
        }
        if(pxy<n){
            if(pyx<n){
                if(!visited[pxy][pyx]||moves+1<minMoves[pxy][pyx]) visit(pxy,pyx,dx,dy,moves+1);
            }
            if(myx>-1){
                if(!visited[pxy][myx]||moves+1<minMoves[pxy][myx]) visit(pxy,myx,dx,dy,moves+1);
            }
        }
        if(mxy>-1){
            if(pyx<n){
                if(!visited[mxy][pyx]||moves+1<minMoves[mxy][pyx]) visit(mxy,pyx,dx,dy,moves+1);
            }
            if(myx>-1){
                if(!visited[mxy][myx]||moves+1<minMoves[mxy][myx]) visit(mxy,myx,dx,dy,moves+1);
            }
        }
        return;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        visited = new boolean [n][n];

        minMoves = new int [n][n];
        for(int p=1;p<n;p++){
            for(int q=1;q<n;q++){
                // your code goes here
                for(int i=0;i<n;i++){
                    for(int j=0;j<n;j++)
                    {    minMoves[i][j]=-1;
                        visited[i][j]=false;
                    }
                }
                //System.out.println(p+"p q"+q);
                visit(n-1,n-1,p,q,0);
        //visit(n-1,n-1,1,3,0);
                System.out.print(minMoves[0][0]);
                System.out.print(" ");
            }
            System.out.println();
        }   
    }
}