#include <bits/stdc++.h>
using namespace std;
const int manx = 25;
int f[25];
bool isValid(int n, int m) {
  int i, j, k;
  for (i = 0; i < n; ++i)
    for (j = 0; j < n; ++j)
      for (k = 0; k < n; ++k) {
        if (j == k) continue;
        if ((f[i] + m) == (f[j] + f[k])) return false;
      }
  return true;
}
int main() {
  int i, j, k, n;
  scanf("%d", &n);
  f[0] = 0;
  f[1] = 1;
  for (i = 2; i < n; ++i) {
    j = f[i - 1];
    while (++j)
      if (isValid(i, j)) break;
    f[i] = j;
  }
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) {
      if (j > 0) printf(" ");
      k = (i == j) ? 0 : (f[i] + f[j]);
      printf("%d", k);
    }
    puts("");
  }
  return 0;
}
