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:
//package Implementations;
import java.io.*;

/**
 * @author Tran Anh Tai
 */
public class LatinSquare implements Runnable
{
    public static void main(String[] args){
        new LatinSquare().run();
    }

    @Override
    public void run(){
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        try{
            int n = Integer.parseInt(in.readLine());
            int result[][] = LatinSquareConstruct(n);
            for (int i = 0; i < n; i++){
                for (int j = 0; j < n; j++){
                    out.print(result[i][j] + " ");
                }
                out.println();
            }
        }
        catch (IOException e){
            out.println("IO Exception!");
        }
        out.close();
    }

    private int[][] LatinSquareConstruct(int n) {
        int result[][] = new int[n][n];
        for (int i = 0; i < n - 1; i++){
            int cur = i;
            for (int j = 0; j < n - 1; j++){
                cur = cur % (n - 1);
                result[i][j] = cur++;
                if (result[i][j] == 0 && i > 0){
                    result[i][j] = n - 1;
                }
            }
        }
        result[0][n - 1] = result[n - 1][0] = n - 1;
        for (int i = 1; i < n - 1; i++){
            result[i][n - 1] = result[n - 1][i] = result[i][i];
            result[i][i] = 0;
        }
        return result;
    }
}