#include<bits/stdc++.h>
using namespace std;
int visited[25][25]={0};
int stamp[25][25]={0};
int main()
{
	int n;
	cin>>n;
	int res[n][n]={0};
	int m=0;
	for(int i=1;i<n;i++)
	{
		for(int j=1;j<=i;j++)
		{
			int q[8][2]={{i,j},{i,-j},{-i,j},{-i,-j},{j,i},{j,-i},{-j,i},{-j,-i}};
			list < pair<int, int> > queue;
			pair <int,int> p (0,0);
		    for(int x=0;x<25;x++)
		    {
		    	for(int y=0;y<25;y++)
		    	{
		    		visited[x][y]=0;
		    		stamp[x][y]=0;
				}
			}
			visited[0][0]=1;
			int f = 0, moves=0; 
			queue.push_back(p);
			while(!queue.empty())
			{
				
				pair <int,int> temp,next;
				temp=queue.front();
				queue.pop_front();
				int x= stamp[temp.first][temp.second];
				for(int k=0;k<8;k++)
				{
					next.first=temp.first+q[k][0];
					next.second=temp.second+q[k][1];
					//cout<<next.first<<endl;
					if(	next.first == n-1 && next.second == n-1 )
					{
						moves = x+1;
						f = 1;
						break;
					}
					//cout<<"visited "<<visited[next.first][next.second]<<endl;
					if(next.first>=0 && next.first<n && next.second>=0 && next.second<n && visited[next.first][next.second]==0)
					{
						queue.push_back(next);
						visited[next.first][next.second]=1;
						stamp[next.first][next.second]=x+1;
					}
				}
				if(f == 1)
				{
					break;
				}
				//cout<<"hi";
			}
			if(f == 1)
			{
				res[i][j] = moves;
				res[j][i] = moves;
			}
			else
			{
				res[i][j] = -1;
				res[j][i] = -1;
			}
		}
	}
	
	for(int i=1;i<n;i++)
		{
			for(int j=1;j<n;j++)
			{	
				cout<<res[i][j]<<" ";
			}
			cout<<endl;
		}
return 0;

}