#!/bin/python3

import sys
import queue

def valid(x,y,n,visited):
    return x>=0 and x<n and y>=0 and y<n and visited[x][y]==0

n = int(input().strip())
# your code goes here

solution = {}

for a in range(1,n):
    for b in range(1,n):
        if (b,a) in solution:
            solution[(a,b)] = solution[(b,a)]
        else: # BFS
            visited = [[0 for _ in range(n)] for _ in range(n)]
            Q = queue.Queue()
            Q.put([0,0,0]) # x, y, steps
            visited[0][0] = 1
            found = False
            while not Q.empty():
                x,y,s = Q.get()
                if x==n-1 and y==n-1:
                    found = True
                    solution[(a,b)] = s
                    break
                for p in range(-1,2,2):
                    for q in range(-1,2,2):
                        if valid(x + p*a, y + q*b, n, visited):
                            Q.put([x+p*a,y+q*b,s+1])
                            visited[x+p*a][y+q*b] = 1
                        if valid(x + p*b, y + q*a, n, visited):
                            Q.put([x+p*b,y+q*a,s+1])
                            visited[x+p*b][y+q*a] = 1
            if not found:
                solution[(a,b)] = -1
for a in range(1,n):
    for b in range(1,n):
        print(solution[(a,b)],end=" ")
    print()