#include <bits/stdc++.h>
using namespace std;
using cat = long long;
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(10);
  int N;
  cin >> N;
  vector<vector<cat> > W(N, vector<cat>(N, 0));
  int seq[11] = {1, 2};
  for (int i = 2; i <= 10; i++) seq[i] = seq[i - 1] + seq[i - 2] + 1;
  cat prod = 1;
  int n = N - 1;
  while (n > 0) {
    for (int i = 0; i < n; i++) W[i][n] = W[n][i] = prod * seq[i];
    prod *= seq[n];
    n--;
  }
  if (N == 10) {
    W[0][1] = W[1][0] = 3;
    int P[10];
    for (int i = 0; i < 10; i++) P[i] = i;
    vector<cat> sum_c, sum_l;
    while (true) {
      if (P[0] < P[9]) {
        cat s = 0;
        int l = 0;
        for (int i = 0; i < 9; i++) {
          if (P[i] + P[i + 1] == 1)
            l++;
          else
            s += W[P[i]][P[i + 1]];
        }
        if (l == 0)
          sum_c.push_back(s);
        else
          sum_l.push_back(s);
      }
      if (!next_permutation(P, P + 10)) break;
    }
    sort(begin(sum_c), end(sum_c));
    sort(begin(sum_l), end(sum_l));
    cat x = 1;
    while (true) {
      bool stop = true;
      int a = 0;
      for (int i = 0; i < (int)sum_c.size(); i++) {
        while (a < (int)sum_l.size() && sum_c[i] - x > sum_l[a]) a++;
        if (a == (int)sum_l.size()) break;
        if (sum_c[i] - x == sum_l[a]) {
          stop = false;
          break;
        }
      }
      if (stop) break;
      x++;
    }
    W[0][1] = W[1][0] = x;
  }
  for (int i = 0; i < N; i++)
    for (int j = 0; j < N; j++) cout << W[i][j] << ((j + 1 == N) ? "\n" : " ");
  return 0;
}
