#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const long long w[10] = {1, 2, 4, 7, 12, 20, 29, 38, 52, 73};
long long dp[(1 << 10) + 1][11];
long long calc(vector<vector<long long> >& G, int N) {
  memset(dp, 0, sizeof(dp));
  for (int bit = 0; bit < (1 << N); ++bit) {
    for (int v = 0; v < N; ++v) {
      if (!(bit & (1 << v))) continue;
      for (int nv = 0; nv < N; ++nv) {
        if (bit & (1 << nv)) continue;
        int nbit = bit | (1 << nv);
        chmax(dp[nbit][nv], dp[bit][v] + G[v][nv]);
      }
    }
  }
  long long res = 0;
  for (int v = 0; v < N; ++v) chmax(res, dp[(1 << N) - 1][v]);
  return res;
}
int main() {
  int N;
  cin >> N;
  vector<vector<long long> > G(N, vector<long long>(N, 0));
  G[0][1] = 1;
  G[1][0] = 1;
  for (int n = 2; n < N; ++n) {
    long long M = calc(G, n);
    for (int v = 0; v < n; ++v) G[v][n] = G[n][v] = M * w[v];
  }
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) cout << G[i][j] << " ";
    cout << endl;
  }
}
