<?php

$handle = fopen ("php://stdin","r");
fscanf($handle,"%d",$n);
// your code goes here

$bfs = [];
for ($i=1;$i<$n;$i++) {
    for ($j=1;$j<$n;$j++) {
        if ($i<=$j) {
            $bfs[$n][$i][$j] = bfs($n,$i,$j);
            print($bfs[$n][$i][$j]);
        } else {
            //print mirrow copy
            print($bfs[$n][$j][$i]);
        }
        if ( $j<$n-1 ) {
            print(" ");
        }    
    }
    print("\n");
}

//bfs(5,1,1);

function bfs($size,$x,$y){
    $start = [1,1];
    $goal = [$size,$size];
    $queue = [$start];
    $dist[$start[0]][start[1]] = 0;
    
    while (count($queue)) {
        $cur = array_pop($queue);
        //print('['.$cur[0].','.$cur[1]."](".$dist[$cur[0]][$cur[1]].")\n");
        if ($cur === $goal) {
            //return $dist[$cur[0]][$cur[1]];
            //break;
        }
        
        foreach ([ [$x,$y],[$y,$x],[-$x,-$y],[-$y,-$x],[$x,-$y],[-$x,$y],[-$y,$x],[$y,-$x] ] as $move) {
            $next_pos = [ $cur[0]+$move[0], $cur[1]+$move[1] ];
            if ($next_pos[0] > $goal[0] or $next_pos[1] > $goal[1] or $next_pos[0] < 1 or $next_pos[1] < 1) {
                continue;
            }
            
            if (!isset($dist[$next_pos[0]][$next_pos[1]]) 
                or 
                (isset($dist[$next_pos[0]][$next_pos[1]]) and $dist[$next_pos[0]][$next_pos[1]] > $dist[$cur[0]][$cur[1]]+1) 
               ) {
                $dist[$next_pos[0]][$next_pos[1]] = $dist[$cur[0]][$cur[1]]+1;
                array_push($queue,$next_pos);
            }
        }
        
    }
    if ( isset($dist[$size][$size]) ) {
        return($dist[$size][$size]);
    } else {
        return -1;
    }
}

?>