#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int fib[20]; 
ll E[20][20];

void solve() {
	cin >> N;
	if(N == 2) {
		cout << 0 << " " << 1 << "\n";
		cout << 1 << " " << 0 << "\n";
		return;
	}
	fib[1] = 1;
	fib[2] = 2;
	rep(i, 3, 10) {
		for(int k = 1; k < 200; k++) {
			vector<int> vec;
			fib[i] = k;
			int tmp = 0;
			rep(a, 1, i + 1) {
				vec.pb(fib[a]);
				tmp++;
			}
			rep(a, 1, i + 1) {
				rep(b, a + 1, i + 1) {
					vec.pb(fib[a] + fib[b]);
					tmp++;
				}
			}
			sort(all(vec));
			vec.erase(unique(all(vec)), vec.end());
			if(sz(vec) == tmp) break;
		}
	}
	E[0][0] = 0; E[0][1] = 1; E[0][2] = 2;
	E[1][0] = 1; E[1][1] = 0; E[1][2] = 3;
	E[2][0] = 2; E[2][1] = 3; E[2][2] = 0;

	rep(k, 3, N) {
		rep(i, 0, k) {
			rep(j, 0, k) {
				E[i][j] *= (fib[k] + fib[k - 1]);
			}
		}
		rep(i, 0, k) {
			E[k][i] = fib[i + 1];
			E[i][k] = fib[i + 1];
		}
	}
	rep(i, 0, N) {
		rep(j, 0, N) {
			cout << E[i][j] << " ";
		}
		cout << "\n";
	}
	// vector<ll> vec;
	// rep(i, 0, N) vec.pb(i);
	// vector<ll> ans;
	// do {
	// 	ll res = 0;
	// 	rep(i, 0, N - 1) {
	// 		res += E[vec[i]][vec[i + 1]];
	// 	}
	// 	ans.pb(res);
	// } while(next_permutation(all(vec)));
	// sort(all(ans));
	// // debug(ans);
	// ans.erase(unique(all(ans)), ans.end());
	// debug(sz(ans));
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 256