#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>


typedef struct
{
    int x;
    int y;
}coordinate;

unsigned char   **vectorMap;
//unsigned short  *dist;
//coordinate      *q;


int getNumberOfMove3(int x, int y, int dx, int dy, int n){
	coordinate 	q[1000];
	int 		dist[1000];
	int 		front = 0;
	int 		rear = 0;
	int			x1;
	int			y1;
	int 		x2;
	int			y2;
	int			move;
	coordinate 	possibleMove[8];

	q[rear].x = n-1;
	q[rear].y = n-1;
	dist[rear]=0;
	rear++;
	vectorMap[n-1][n-1] = 1;

	possibleMove[0].x = 1*dx;
	possibleMove[0].y = 1*dy;

	possibleMove[1].x = -1*dx;
	possibleMove[1].y = 1*dy;

	possibleMove[2].x = 1*dx;
	possibleMove[2].y = -1*dy;

	possibleMove[3].x = -1*dx;
	possibleMove[3].y = -1*dy;

	possibleMove[4].x = 1*dy;
	possibleMove[4].y = 1*dx;

	possibleMove[5].x = -1*dy;
	possibleMove[5].y = 1*dx;

	possibleMove[6].x = 1*dy;
	possibleMove[6].y = -1*dx;

	possibleMove[7].x = -1*dy;
	possibleMove[7].y = -1*dx;


	while(rear!=front){

		x1 = q[front].x;
		y1 = q[front].y;
		move = dist[front];
		front++;
		if(x1 == x && y1 == y)
			break;
		
		for(int i=0; i<8; i++){
			x2 = x1 + possibleMove[i].x;
			y2 = y1 + possibleMove[i].y;
			if(x2>=0 && x2<n && y2>=0 && y2<n && !vectorMap[x2][y2]){
				q[rear].x = x2;
				q[rear].y = y2;
				dist[rear] = move+1;
				rear++;		
				vectorMap[x2][y2] = 1;
			}
		}
	}
	if(x1 == x && y1 == y)
		return move+1;
	else
		return 0;
}

int main(){
    int n; 
    scanf("%d",&n);
    
	// your code goes here
    int cnt = 0;
    

	vectorMap = (unsigned char **)malloc(n*sizeof(unsigned char *));
	for(int i=0; i<n; i++){
		vectorMap[i] = (unsigned char *)malloc(n*sizeof(unsigned char));
	}
    
    //q = (coordinate *) malloc(n*sizeof(coordinate));
    //dist = (unsigned short *) malloc(n*sizeof(unsigned short));
	
	for(int i=1; i<n; i++)
    {
        for(int j=1; j<n; j++)
        {
			for(int k=0; k<n; k++)
				memset(vectorMap[k], 0, n);
				
            cnt = getNumberOfMove3(i, j, i-0, j-0, n);
            
            if(cnt)
                printf("%d ", cnt);
            else
                printf("-1 ");
        }
        printf("\n");
    }

	for(int i=0; i<n; i++){
		free(vectorMap[i]);
	}
	free(vectorMap);
    //free(q);
    //free(dist);
    return 0;
}