Pyramid Construction

Given an integer n, construct a pyramid of height n. Each row i of the pyramid consists of numbers starting from 1 up to i and then descending back to 1, with both leading and trailing zeroes added so that each row has a uniform width of $2n-1$. For example, when n = 3, the pyramid is:

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

Print the pyramid to stdout with each row on a new line and numbers separated by a single space.

inputFormat

The input consists of a single integer n ($1\le n\le 100$), representing the height of the pyramid.

outputFormat

Output the pyramid with n rows. Each row should contain exactly $2n-1$ integers separated by a single space.

1

1