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

public class Solution {
    
    private static int numMoves(int a, int b, int n){
        int moves = 0;
        int[][] grid = new int[n][n];
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                grid[i][j]=-1;
            }
        }
        subNumMoves(a, b, n, grid, 0, 0, 0);
        return grid[n-1][n-1];
    }
    
    private static void subNumMoves(int a, int b, int n, int[][] grid, int x, int y, int count){
        //variable: grid, x, y, count
        //constant: a, b, n
        if(x==n-1 && y==n-1){
            grid[x][y]=count;
            return;
        }
        if(x<0 || y<0 || x>n-1 || y>n-1){return;}
        if(grid[x][y]!=-1 && grid[x][y]<=count){return;}
        
        grid[x][y]=count;
        
        subNumMoves(a, b, n, grid, x+a, y+b, count+1);
        subNumMoves(a, b, n, grid, x+a, y-b, count+1);
        subNumMoves(a, b, n, grid, x-a, y+b, count+1);
        subNumMoves(a, b, n, grid, x-a, y-b, count+1);
        subNumMoves(a, b, n, grid, x+b, y+a, count+1);
        subNumMoves(a, b, n, grid, x+b, y-a, count+1);
        subNumMoves(a, b, n, grid, x-b, y+a, count+1);
        subNumMoves(a, b, n, grid, x-b, y-a, count+1);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        in.close();
        // your code goes here
        int[][] arr = new int[n-1][n-1];
        for(int a=1; a<n; a++){
            for(int b=1; b<n; b++){
                int moves = 0;
                if(b<a){
                    moves = arr[b-1][a-1];
                }
                else if(a==b && (n-1)%a==0){
                    moves = (n-1)/a;
                }
                else if(a+b==(n-1)){
                    moves = 2;
                }
                else if(a>((n-1)/2) && b>((n-1)/2)){
                    moves = -1;
                }
                else if(a==1 && b==(n-1)){
                    if((n-1)%2==0){moves = 2*(n-1);}
                    else{moves = n-1;}
                }
                else if(a==2 && b==(n-1) && (n-1)%2==1){moves = -1;}
                else{
                    moves = numMoves(a,b,n);//recursion here
                }
                if(b>a){
                    arr[a-1][b-1] = moves;
                }
                System.out.print(moves + " ");
            }
            System.out.println();
        }
        //System.out.println("test");
    }
}