#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;

int main(){
	ll w[11][11] = {};
	w[0][1] = w[1][0] = 1;
	w[2][0] = w[0][2] = 2;
	w[2][1] = w[1][2] = 3;
	w[3][0] = w[0][3] = 4;
	w[3][1] = w[1][3] = 8;
	w[3][2] = w[2][3] = 13;
	ll l = 23;
	for(int k = 4 ; k < 10 ; k ++){
		vector<ll> vec;
		vec.push_back(1);
		vec.push_back(2);
		while(vec.size() < k){
			vec.push_back(vec[vec.size()-2]+vec[vec.size()-1]+1);
		}
		int cnt = 0;
		for(int i = 1 ; i <= k-2 ; i ++){
			cnt += i;
		}
		for(int t = 0 ; t < k ; t ++){
			w[k][t] = w[t][k] = (l-cnt)*vec[t];
		}
		l = (l-cnt)*(vec[vec.size()-2]+vec[vec.size()-1]+1)-12;
	}
	int n;
	cin >> n;
	for(int i = 0 ; i < n ; i ++){
		for(int j = 0 ; j < n ; j ++){
			printf("%lld%c",w[i][j],(j==n-1)?'\n':' ');
		}
	}
}