#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1111;
int n,p[N][N];
signed main(){
	srand(time(NULL));
	cin>>n;
	assert(n<1000);
	for(int i=1,cc=0;i<n;i++){
		for(int j=i+1;j<=n;j++){
			cout<<(p[i][j]=p[j][i]=(i*j-i-j+10)%10);
		}
		cout<<"\n";
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++){
				if(i==j||j==k||i==k)continue;
				if(p[i][j]==p[j][k]&&p[i][k]==p[j][k]){
					cout<<i<<" "<<j<<" "<<k<<endl;
					assert(0);
				}
				for(int a=1;a<=n;a++){
					for(int b=1;b<=n;b++){
						set<int>q={a,b,i,j,k};
						if(q.size()!=5)continue;
						if(p[i][j]==p[j][k]&&p[j][k]==p[k][a]&&p[k][a]==p[a][b]&&p[a][b]==p[b][i]){
							cout<<i<<" "<<j<<" "<<k<<" "<<a<<" "<<b<<endl;
							assert(0);
						}
					}
				}
			}
		}
	}
}