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:
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class E
{
	static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
	static MyScanner sc = new MyScanner(System.in);
	static StringBuilder result = new StringBuilder();
	
	public static void main(String... args)
	{
		int n = sc.nextInt();
		int[][] matrix = new int[n][n];
		boolean[][] c = new boolean[n][n];
		boolean[][] r = new boolean[n][n];
		
		int num = 1;
		
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				if (i != j)
				{
					while (matrix[i][j] == 0)
					{
						// fill
						if (!r[i][num] && !c[j][num])
						{
							r[i][num] = true;
							c[j][num] = true;
							matrix[i][j] = num;
							r[j][num] = true;
							c[i][num] = true;
							matrix[j][i] = num;
						}
						num++;
						if (num == n)
						{
							num = 1;
						}
					}
					
				}
			}
		}
		
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				result.append(matrix[i][j]);
				result.append(" ");
			}
			result.append("\n");
		}
		
		System.out.println(result);
	}
	
	/**
	 * Flatfoot's Scanner with slight modifications.
	 * @author <a href="http://codeforces.com/profile/Flatfoot">Flatfoot</a>
	 * @see <a href="http://codeforces.com/blog/entry/7018">Source</a> 
	 */
	private static class MyScanner
	{
		BufferedReader br;
		StringTokenizer st;
		
		MyScanner(InputStream in)
		{
			this.br = new BufferedReader(new InputStreamReader(in));
		}
		
		String next()
		{
			while (this.st == null || !this.st.hasMoreElements())
			{
				try
				{
					this.st = new StringTokenizer(this.br.readLine());
				}
				catch (IOException e)
				{
					e.printStackTrace();
				}
			}
			return this.st.nextToken();
		}
		
		int nextInt()
		{
			return Integer.parseInt(this.next());
		}
		
		long nextLong()
		{
			return Long.parseLong(this.next());
		}
		
		double nextDouble()
		{
			return Double.parseDouble(this.next());
		}
		
		String nextLine()
		{
			String str = "";
			try
			{
				str = this.br.readLine();
			}
			catch (IOException e)
			{
				e.printStackTrace();
			}
			return str;
		}
		
	}
}