Problem: Before the start of the football season in Berland a strange magic ritual is held. The most experienced magicians have to find a magic matrix of the size n × n (n is even number). Gods will never allow to start the championship without it. Matrix should contain integers from 0 to n - 1, main diagonal should contain only zeroes and matrix should be symmetric. Moreover, all numbers in each row should be different. Magicians are very tired of the thinking process, so they ask you to write a program to find such matrix.

Input

The first line contains one integer n (2 ≤ n ≤ 1000), n is even.

Output

Output n lines with n numbers each — the required matrix. Separate numbers with spaces. If there are several solutions, output any.

Examples

Input

2


Output

0 1
1 0


Input

4


Output

0 1 3 2
1 0 2 3
3 2 0 1
2 3 1 0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int maps[1005][1005], n;
bool flag[1005][1005][2], vis[1005], flag1;
void inits() {
  memset(maps, 0, sizeof(maps));
  memset(flag, 0, sizeof(flag));
  memset(vis, 0, sizeof(vis));
  return;
}
void build() {
  for (int i = 1; i < n; i++) {
    int j = 1;
    while (i - j >= 0 && j < n) {
      if (i - j == j) {
        j++;
        continue;
      }
      maps[j][i - j] = maps[0][i];
      flag[j][maps[0][i]][0] = 1;
      flag[i - j][maps[0][i]][1] = 1;
      j++;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (maps[i][j] == 0 && i != j) {
        for (int k = 1; k <= n - 1; k++) {
          if (!flag[i][k][0] && !flag[j][k][1]) {
            maps[i][j] = k;
            flag[i][k][0] = 1;
            flag[j][k][1] = 1;
            break;
          }
        }
      }
    }
  }
  return;
}
bool jg() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i != j && !maps[i][j]) return false;
    }
  }
  return true;
}
void dfs(int dep) {
  if (flag1) return;
  for (int i = 1; i < n; i++) {
    if (dep == 1) inits();
    if (!vis[i]) {
      maps[0][dep] = i;
      flag[0][i][0] = 1;
      flag[dep][i][1] = 1;
      vis[i] = 1;
      if (dep == (n - 1)) {
        build();
        flag1 = jg();
        if (flag1) {
          for (int i = 0; i < n; i++) {
            printf("%d", maps[i][0]);
            for (int j = 1; j < n; j++) {
              printf(" %d", maps[i][j]);
            }
            printf("\n");
          }
        }
        return;
      } else {
        dfs(dep + 1);
        vis[i] = 0;
        flag[0][i][0] = 0;
        flag[dep][i][1] = 0;
      }
    }
  }
}
int main() {
  while (~scanf("%d", &n)) {
    flag1 = 0;
    dfs(1);
  }
  return 0;
}