#!/bin/python

import sys



n = int(raw_input().strip())


tupl = (1,1)
def searching(currpt,step,steparr): #use (i,j) tupl, size, currpt = (x,y), #steps
    fail = currpt[0]<0 or currpt[1]<0 or currpt[1]>=n or currpt[0]>=n or (steparr[currpt[0]][currpt[1]] > 0 and steparr[currpt[0]][currpt[1]]<step) 
    if fail: return 10000
    steparr[currpt[0]][currpt[1]] = step
    if currpt == (n-1,n-1): return step
    return min(searching((currpt[0]+tupl[0],currpt[1]+tupl[1]),step+1,steparr),
    searching((currpt[0]-tupl[0],currpt[1]-tupl[1]),step+1,steparr),
    searching((currpt[0]+tupl[1],currpt[1]+tupl[0]),step+1,steparr),
    searching((currpt[0]-tupl[1],currpt[1]-tupl[0]),step+1,steparr),
    searching((currpt[0]+tupl[0],currpt[1]-tupl[1]),step+1,steparr),
    searching((currpt[0]-tupl[0],currpt[1]+tupl[1]),step+1,steparr),
    searching((currpt[0]+tupl[1],currpt[1]-tupl[0]),step+1,steparr),
    searching((currpt[0]-tupl[1],currpt[1]+tupl[0]),step+1,steparr))


for i in xrange(1,n):
    tempstring = ""
    for j in xrange(1,n):
        tupl = (i,j)
        testarr = [[0 for r in xrange(n)] for q in xrange(n)]
        search = searching((0,0),0,testarr)
        if search == 10000:  search = -1
        tempstring+=str(search)+ " "
    print tempstring