#include<bits/stdc++.h>
#define INF 9223372036854775807
#define mod 1000000007
#define ll  long long int
#define ld double
#define endl '\n'
#define sz 30 + 5
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;

typedef pair<ll,ll> two;

ll arr[sz][sz],vis[sz][sz],dp[sz][sz],n,level = 0;
queue <pair<ll,ll> > q;

bool check(ll x, ll y){
	if(x < 0 || y < 0 || x >= n || y >= n)
		return false;
	if(vis[x][y] == -1)
		return true;
	else
		return false;
}

ll bfs(ll a , ll b){
	q.push(make_pair(0,0));
	vis[0][0] = 0;
	two temp;
	ll i,j,x,y;
	while(!q.empty()){
		temp = q.front();
		x = temp.first;
		y = temp.second;
		//cout<<x<<' '<<y<<' '<<vis[x][y]<<endl; 
		q.pop();
		if(check(x-a,y-b)){
			vis[x-a][y-b] = vis[x][y] + 1;
			q.push(make_pair(x-a,y-b));
		}
		if(check(x-a,y+b)){
			vis[x-a][y+b] = vis[x][y] + 1;
			q.push(make_pair(x-a,y+b));
		}
		if(check(x+a,y-b)){
			vis[x+a][y-b] = vis[x][y] + 1;
			q.push(make_pair(x+a,y-b));
		}
		if(check(x+a,y+b)){
			vis[x+a][y+b] = vis[x][y] + 1;
			q.push(make_pair(x+a,y+b));
		}
		
		
		if(check(x-b,y-a)){
			vis[x-b][y-a] = vis[x][y] + 1;
			q.push(make_pair(x-b,y-a));
		}
		if(check(x-b,y+a)){
			vis[x-b][y+a] = vis[x][y] + 1;
			q.push(make_pair(x-b,y+a));
		}
		if(check(x+b,y-a)){
			vis[x+b][y-a] = vis[x][y] + 1;
			q.push(make_pair(x+b,y-a));
		}
		if(check(x+b,y+a)){
			vis[x+b][y+a] = vis[x][y] + 1;
			q.push(make_pair(x+b,y+a));
		}
		
	}
	return vis[n-1][n-1];
}


void solve(ll x){
	ll i,j;
	for(i = 1; i < n; i++){
		memset(vis,-1,sizeof(vis));
		while(!q.empty())
			q.pop();
		cout<<bfs(x,i)<<' ';
	}
	cout<<endl;
	//memset(vis,-1,sizeof(vis));
	//cout<<bfs(3,2)<<endl;
}


int main(){
	ll i,j;
	fast();
	cin>>n;
	for(i = 1; i < n; i++)
		solve(i);
	return 0;
}