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

public class Solution {

    public static void makeZero(int a[][] , int n){    
         for(int i=0 ; i< n ; i++){
            for(int j=0; j<n; j++){
                a[i][j]=-1;
            }
        }
    }
    
    public static void display(int a[][] , int n){    
         for(int i=1 ; i< n ; i++){
            for(int j=1; j<n; j++){
                System.out.printf( "%d " ,a[i][j]);
            }
             System.out.println();
        }
    }
    
    public static boolean makeMove(int tahta[][], int n, int a , int b ,int mark){
     boolean moved=false;
        //mark harekete baslanacak noktalari isaretliyo. her tur marki buyut.
         for(int i=0 ; i< n ; i++){
            for(int j=0; j<n; j++){
                if( tahta[i][j] == mark ) {
               if(i+a<n && j+b<n && tahta[i + a ][j + b] ==-1) {tahta[i + a ][j + b] = mark +1;
                    moved = true;
                    }
                if(i-a>=0 && j-b>=0 && tahta[i - a][j - b]==-1) { tahta[i - a][j - b] =mark +1;
                 moved = true;
                    }
                if(i+a<n && j-b>=0 && tahta[i +a ][j - b]==-1) {tahta[i +a ][j - b] =mark +1;
                 moved = true;
                    }
                if(i-a>=0 && j+b < n && tahta[i-a][j+b]==-1) {tahta[i-a][j+b] =mark +1;
                moved = true;
                    }
                if(i+b<n && j-a >= 0 && tahta[i + b][j - a]==-1) {tahta[i + b][j - a] =mark +1;
                 moved = true;
                    }
                if(i-b>=0 && j-a>=0 && tahta[i - b][j - a]==-1) {tahta[i - b][j - a] =mark +1;
                 moved = true;
                    }
                if(i+b<n && j+a<n && tahta[i+b][j+a]==-1){ tahta[i+b][j+a] =mark +1;
                 moved = true;
                    }
                if(i-b>=0 && j+a <n && tahta[i-b][j+a]==-1) {tahta[i-b][j+a] =mark +1;
                     moved = true;}
                }
                
            }
        
    }
   
    return moved;
    }
    
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        // your code goes here
       int mark;
        int tahta[][] = new int[n][n];
        int sonuc[][] = new int[n][n];
     /*    
        makeZero(sonuc, n);
        makeZero(tahta, n);
        display(tahta,n);
       System.out.println();
       System.out.println();
        
        tahta[0][0] = 0;
        display(tahta,n);
        
       System.out.println();
       System.out.println();
       int a=1;
        int b=2;
        while(tahta[n-1][n-1] ==0 ){
            makeMove(tahta, n, a,b,mark);
            mark++;   
        }
        sonuc[a][b]=tahta[n-1][n-1] - 1;
        sonuc[b][a]=tahta[n-1][n-1] - 1;
    
        display(sonuc,n);
        
        */
        
      /*  makeMove(tahta, n, 1,3,1);
        display(tahta,n);
        
       System.out.println();
       System.out.println();
        
        makeMove(tahta, n, 1,3,2);
        display(tahta,n);
        
      */  
       for(int a=1; a<n; a++){
            
            for(int b=1; b<=a; b++){
                
               mark=0;
               makeZero(tahta, n); 
                tahta[0][0] =0;
                 while(tahta[n-1][n-1] ==-1 ){
           if(  ! makeMove(tahta, n, a,b,mark) ) break;
            mark++;   
        }
        sonuc[a][b]=tahta[n-1][n-1] ;
        sonuc[b][a]=tahta[n-1][n-1] ;
                
                
            }
            
        }
        display(sonuc,n);
       
        
    }
}