Given a positive integer n, print Floyd's triangle with n rows, using consecutive integers starting from 1.

Input

• One positive integer n.

Output

• Numbers on the same line are separated by exactly one space.

Constraints

• 1 <= n <= 40

Example

Input

4

Output

1
2 3
4 5 6
7 8 9 10