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

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        // your code goes here
        int[][] solution = new int[n-1][n-1];
        for (int i=0; i<n-1 ; i++){
            for(int j=0; j<n-1 ; j++){
                if(solution[i][j] == 0) {
                    int st = getMinSteps(n, i + 1, j + 1);
                    solution[i][j] = st;
                    solution[j][i] = st;
                }
            }
        }
        for (int i=0; i<n-1 ; i++){
            for(int j=0; j<n-1 ; j++){
                System.out.print(solution[i][j] + " ");
            }
            System.out.println();
        }

    }

    public static int getMinSteps(int n, int xMove, int yMove){
        int[][] chessBoard = new int[n][n];
        Point inPoint = new Point(0, 0 ,0);
        Queue<Point> queue = new LinkedList<Point>();
        queue.add(inPoint);
        int X,Y;
        while(! queue.isEmpty()){
            Point point = queue.poll();
            if(point.x == n-1 && point.y == n-1) return point.steps;
            X=point.x+xMove; Y=point.y+yMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x+xMove; Y=point.y-yMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x-xMove; Y=point.y+yMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x-xMove; Y=point.y-yMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x+yMove; Y=point.y+xMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x+yMove; Y=point.y-xMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x-yMove; Y=point.y+xMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }
            X=point.x-yMove; Y=point.y-xMove;
            if(validMove(chessBoard,n, X,Y)){
                Point newPoint = new Point(X,Y,point.steps+1);
                chessBoard[X][Y] = 1;
                queue.add(newPoint);
            }

        }
        return -1;
    }

    public static boolean validMove(int[][] chessBoard, int n , int x, int y){
        return (x>=0 && x<n && y>=0 && y<n && chessBoard[x][y]!= 1);
    }
}


class Point {
    public int x,y,steps;
    public Point(int x,int y, int steps){
        this.x=x;
        this.y=y;
        this.steps=steps;
    }
}