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

public class Solution {
    public static int[][] getKnightSteps(int n){
        int[][] result=new int[n-1][n-1];
        for(int i=0; i<result.length; i++){
            for(int j=i; j<result[0].length; j++){
                int[][] board=new int[n][n];
                for(int k=0; k<board.length; k++)
                    for(int l=0; l<board[0].length; l++)
                        board[k][l]=625;
                    board[0][0]=0;
                result[i][j]=getSteps(board, i+1, j+1,0,0);
                result[j][i]=result[i][j];
            }
        }
        return result;
    }
    public static int getSteps(int[][] board, int a, int b, int base_i, int base_j){
        int n=board.length;
        int[][] positions=new int[][]{{base_i+a, base_j+b }, {base_i-a, base_j+b },{base_i+a, base_j-b },{base_i-a, base_j-b },{base_i+b, base_j+a }, {base_i-b, base_j+a },{base_i+b, base_j-a },{base_i-b, base_j-a }};
        for(int l=0; l<8; l++ )
            goNextStep(board, base_i,  base_j, positions[l][0],  positions[l][1] );
        if(board[n-1][n-1]>=625)
            return -1;
        else
            return board[n-1][n-1];
    }
    private static void goNextStep(int[][] board, int base_i, int base_j, int new_i, int new_j){
        if (isValid(new_i, new_j, board.length) && updateBoard(board,  base_i,  base_j,  new_i,  new_j))
            getSteps(board, new_i-base_i, new_j-base_j, new_i, new_j );
        else return;
    }
    private static boolean isValid(int new_i, int new_j, int board_l){
        return (new_i<board_l && new_i>=0 && new_j<board_l && new_j>=0);
    }
    private static boolean updateBoard(int[][] board, int base_i, int base_j, int new_i, int new_j){
        if(board[new_i][new_j]<=(board[base_i][base_j]+1))
            return false;
        else{
            board[new_i][new_j]=board[base_i][base_j]+1;
            return true;
        }
    }                    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        // your code goes here
        int[][] ret=getKnightSteps(n);
        for(int i=0; i<ret.length; i++){
            for(int j=0; j<ret[0].length; j++)
                System.out.format("%d ", ret[i][j]);
            System.out.format("\n");
        }
    }
}