#include <bits/stdc++.h>
using namespace std;
void Yes() {
  cout << "Yes" << endl;
  exit(0);
}
void No() {
  cout << "No" << endl;
  exit(0);
}
const int MAX_SIZE = 1000010;
class mint {
 public:
  static long long MOD;
  long long x;
  mint() : x(0) {}
  mint(long long x) : x(x % MOD) {}
  mint operator-() const { return x ? MOD - x : 0; }
  mint &operator+=(const mint &a) {
    if ((x += a.x) >= MOD) {
      x -= MOD;
    }
    return *this;
  }
  mint &operator-=(const mint &a) { return *this += -a; }
  mint &operator*=(const mint &a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint &operator/=(const mint &a) { return (*this *= power(MOD - 2)); }
  mint operator+(const mint &a) const { return mint(*this) += a; }
  mint operator-(const mint &a) const { return mint(*this) -= a; }
  mint operator*(const mint &a) const { return mint(*this) *= a; }
  mint operator/(const mint &a) const { return mint(*this) /= a; }
  bool operator<(const mint &a) const { return x < a.x; }
  bool operator==(const mint &a) const { return x == a.x; }
  const mint power(long long N) {
    if (N == 0) {
      return 1;
    } else if (N % 2 == 1) {
      return *this * power(N - 1);
    } else {
      mint half = power(N / 2);
      return half * half;
    }
  }
};
long long mint::MOD = 1e9 + 7;
istream &operator>>(istream &stream, mint &a) { return stream >> a.x; }
ostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }
mint inv[MAX_SIZE];
mint fact[MAX_SIZE];
mint factinv[MAX_SIZE];
void init() {
  inv[1] = 1;
  for (int i = 2; i < MAX_SIZE; i++) {
    inv[i] = (-inv[mint::MOD % i]) * (mint::MOD / i);
  }
  fact[0] = factinv[0] = 1;
  for (int i = 1; i < MAX_SIZE; i++) {
    fact[i] = mint(i) * fact[i - 1];
    factinv[i] = inv[i] * factinv[i - 1];
  }
}
mint choose(int n, int k) {
  if (n >= 0 && k >= 0 && n - k >= 0) {
    return fact[n] * factinv[k] * factinv[n - k];
  }
  return 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
int N;
long long w[10][10];
int X[10];
vector<long long> V;
unordered_set<int> H;
void make_vector() {
  for (auto i = 0; i < N; i++) {
    for (auto i = 1;; i++) {
      if (H.find(i) != H.end()) {
        continue;
      }
      for (auto &x : V) {
        if (H.find(x + i) != H.end()) {
          continue;
        }
      }
      V.push_back(i);
      H.insert(i);
      for (auto &x : V) {
        H.insert(x + i);
      }
      break;
    }
  }
}
long long hamilton_path(int K) {
  long long ans = 0;
  for (auto i = 0; i < K; i++) {
    X[i] = i;
  }
  do {
    long long t = 0;
    for (auto i = 0; i < K - 1; i++) {
      t += w[X[i]][X[i + 1]];
    }
    (ans = max(ans, t));
  } while (next_permutation(X, X + K));
  return ans;
}
int main() {
  cin >> N;
  for (auto i = 0; i < N; i++) {
    w[i][i] = 0;
  }
  make_vector();
  for (auto i = 1; i < N; i++) {
    long long M = hamilton_path(i) + 1;
    for (auto j = 0; j < i; j++) {
      w[i][j] = w[j][i] = M * V[j];
    }
  }
  for (auto i = 0; i < N; i++) {
    for (auto j = 0; j < N; j++) {
      cout << w[i][j];
      if (j < N - 1) {
        cout << " ";
      } else {
        cout << endl;
      }
    }
  }
}
