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

public class Solution {
    public static class Cell{
        int n;
        int x;
        int y;
        int cost;
        Cell(int n, int x, int y){
            this.n = n;
            this.x = x;
            this.y = y;
            cost = Integer.MAX_VALUE;
        }
        boolean isValid(){
            if (x>=0 && x<n && y>=0 && y<n){
                return true;
            }else{
                return false;
            }
        }
        int getIndex(){
            return (y*n) + x;
        }
    }
    
    static int GetResult(int x, int y, int n){
        HashMap<Integer, Cell> map = new HashMap<Integer, Cell>();
        Queue<Cell> q = new LinkedList<Cell>();
        for (int i=0; i<(n) ;i++){
            for (int j=0; j<(n) ;j++){
                Cell cell = new Cell(n, j, i);
                map.put(cell.getIndex(), cell);
            }
        }
        
        Cell c = map.get(0);
        c.cost = 0;
        q.add(c);
        
        int[] dx;
        int[] dy;
        int moves = 0;
        if (x==y){
            dx = new int[]{x,  x, -x, -x};
            dy = new int[]{y, -y,  y, -y};
            moves = 4;
        }else {
            dx = new int[]{x,  x, -x, -x, y, -y,  y, -y};
            dy = new int[]{y, -y,  y, -y, x,  x, -x, -x};
            moves = 8;
        }
        
        while(!q.isEmpty()){
            Cell prevCell = q.remove();
            for (int i=0; i<moves; i++){
                Cell cell = new Cell(n, prevCell.x + dx[i], prevCell.y + dy[i]);
                if (!cell.isValid()){
                    continue;
                }
                int index = ((prevCell.y + dy[i])*n) + prevCell.x + dx[i];
                cell = map.get(index);
                if ((prevCell.cost + 1) < cell.cost){
                    cell.cost = prevCell.cost + 1;
                    q.add(cell);
                }
            }
        }
        if (map.get(n*n-1).cost != Integer.MAX_VALUE){
            return map.get(n*n-1).cost;
        }else{
            return -1;
        }
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        
        for (int i = 1; i<n; i++){
            for (int j = 1; j<n; j++){
                System.out.print(GetResult(i, j, n));
                System.out.print(" ");
            }
            System.out.println(" ");
        }
    }
}