Present from Lena

一个以 $0$ 到 $n$ 的数字构成的图案应该以 $n$ 为中心，数字越接近边缘越少。例如，当 $n=5$ 时，图案应如下图所示： ``` 0 010 01210 0123210 012343210 01234543210 012343210 0123210 01210 010 0 ``` 现在给定最大数字 $n$，按照要求输出图案。 数据范围为 $2\le n\le 9$ 。

Vasya's birthday is approaching and Lena decided to sew a patterned handkerchief to him as a present. Lena chose digits from $ 0 $ to $ n $ as the pattern. The digits will form a rhombus. The largest digit $ n $ should be located in the centre. The digits should decrease as they approach the edges. For example, for $ n=5 $ the handkerchief pattern should look like that: ``` 0 0 1 0 0 1 2 1 0 0 1 2 3 2 1 0 0 1 2 3 4 3 2 1 0 0 1 2 3 4 5 4 3 2 1 0 0 1 2 3 4 3 2 1 0 0 1 2 3 2 1 0 0 1 2 1 0 0 1 0 0 ``` Your task is to determine the way the handkerchief will look like by the given $ n $ .

The first line contains the single integer $ n $ ( $ 2<=n<=9 $ ).

Print a picture for the given $ n $ . You should strictly observe the number of spaces before the first digit on each line. Every two adjacent digits in the same line should be separated by exactly one space. There should be no spaces after the last digit at the end of each line.

2

    0
  0 1 0
0 1 2 1 0
  0 1 0
    0

3

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