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 JAVA):

Solution:
// https://codeforces.com/contest/12/problem/E
import java.util.*;
import java.io.*;
import java.math.*;

public class StartSeason {
    static BufferedReader _in = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer _stk;
    static String next() {
        try {
            while (_stk == null || !_stk.hasMoreTokens()) {
                String l = _in.readLine();
                if(l==null) return null;
                _stk = new StringTokenizer(l);
            }
 
            return _stk.nextToken();
        } catch(Exception ex) {
            throw new RuntimeException("Failed reading input", ex);
        }
    }
    static int nextInt() { return Integer.parseInt(next()); }
    static double nextDouble() { return Double.parseDouble(next()); }

    public static void main(String[] args) throws IOException {
        try(PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)))) {
            int N = nextInt();

            int matrix[][] = new int[N][N];
            for(int i=0; i<N-1; i++)
                for(int j=0; j<N-1; j++)
                    matrix[i][j] = ((i+j)%(N-1)) + 1;

            for(int i=0; i<N; i++) {
                matrix[i][N-1] = matrix[N-1][i] = matrix[i][i];
                matrix[i][i] = 0;
            }


            for(int[] row: matrix) {
                for(int x: row) {
                    pw.print(x);
                    pw.print(' ');
                }
                pw.println();
            }
        }
    }



}