Problem: Volodya has recently visited a very odd town. There are N tourist attractions in the town and every two of them are connected by a bidirectional road. Each road has some travel price (natural number) assigned to it and all prices are distinct. But the most striking thing about this town is that each city sightseeing tour has the same total price! That is, if we choose any city sightseeing tour — a cycle which visits every attraction exactly once — the sum of the costs of the tour roads is independent of the tour. Volodya is curious if you can find such price system with all road prices not greater than 1000.

Input

Input contains just one natural number (3 ≤ N ≤ 20) — the number of town attractions.

Output

Output should contain N rows containing N positive integer numbers each — the adjacency matrix of the prices graph (thus, j-th number in i-th row should be equal to the price of the road between the j-th and the i-th attraction). Diagonal numbers should be equal to zero. All numbers should not be greater than 1000. All prices should be positive and pairwise distinct. If there are several solutions, output any of them.

Examples

Input

3


Output

0 3 4 
3 0 5 
4 5 0 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
double const PI = 4 * atan(1.0);
using namespace std;
int n, a[22];
set<int> S;
int hash(int i) {
  return (13 * i * i * i * i + 17 * i * i * i + 127655 * i * i) % 1000;
}
bool thoaman(int x, int t) {
  for (int i = 1; i < t; i++)
    for (int j = i + 1; j < t; j++)
      for (int k = j + 1; k < t; k++)
        if (a[j] + a[k] - a[i] == x) return false;
  return true;
}
int main() {
  a[1] = 1;
  a[2] = 2;
  a[3] = 3;
  for (int i = 4; i <= 20; i++) {
    for (int j = a[i - 1] + 1;; j++) {
      if (thoaman(j, i)) {
        a[i] = j;
        break;
      }
    }
  }
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == j)
        printf("0 ");
      else
        printf("%d ", a[i] + a[j]);
    }
    printf("\n");
  }
}