#!/bin/python

import sys

def possible_moves(i, j, x, y, m):
	return filter(lambda e: 0<=e[0] and e[0]<m and 0<=e[1] and e[1]<m,
		[(x+i,y+j), (x-i,y+j), (x+i, y-j), (x-i, y-j),
		 (x+j,y+i), (x-j,y+i), (x+j, y-i), (x-j, y-i)])

def knight(i, j):
	print "TODO"


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


class Graph:
  def __init__(self):
    self.nodes = set()
    self.edges = dict()
    self.distances = {}

  def add_node(self, value):
    self.nodes.add(value)
    self.edges[value] = []

  def add_edge(self, from_node, to_node, distance):
    self.edges[from_node].append(to_node)
    self.edges[to_node].append(from_node)
    self.distances[(from_node, to_node)] = distance


def dijsktra(graph, initial):
  visited = {initial: 0}
  path = {}

  nodes = set(graph.nodes)

  while nodes: 
    min_node = None
    for node in nodes:
      if node in visited:
        if min_node is None:
          min_node = node
        elif visited[node] < visited[min_node]:
          min_node = node

    if min_node is None:
      break

    nodes.remove(min_node)
    current_weight = visited[min_node]

    for edge in graph.edges[min_node]:
      weight = current_weight + graph.distances[(min_node, edge)]
      if edge not in visited or weight < visited[edge]:
        visited[edge] = weight
        path[edge] = min_node

  return visited#, path

#make graph of possible moves
#do dijkstras to find shortest distance
for i in range(1,n):
	for j in range(1,n):
		G = Graph()
		[[G.add_node(x*n+y) for x in range(n)] for y in range(n)]
		for x in range(n):
			for y in range(n):
				for e in possible_moves(i,j,x,y,n):
					G.add_edge(x*n+y, e[0]*n+e[1], 1)
		try:
			print dijsktra(G, 0)[(n-1)*n+(n-1)],
		except KeyError:
			print "-1",
	print "\n",