#include <bits/stdc++.h>
using namespace std;
const long long MXN = 3e5 + 10;
long long n, pnt = 1;
long long A[MXN];
bool vis[MXN];
inline void Mark(long long x) {
  if (1 <= x && x <= 1000) vis[x] = 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    while (vis[pnt]) pnt++;
    A[i] = pnt;
    pnt++;
    assert(pnt <= 1000);
    for (int j = 1; j < i; j++) {
      for (int k = j + 1; k < i; k++) {
        Mark(A[i] + A[j] - A[k]);
        Mark(A[k] + A[j] - A[i]);
        Mark(A[i] + A[k] - A[j]);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cout << (i != j) * (A[i] + A[j]) << ' ';
    }
    cout << '\n';
  }
  return 0;
}
