Reverse Number Triangle

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given $n$, print $n$ rows. The first contains $1,2,\ldots,n$; each subsequent row has one fewer number, and the last contains only $1$. Separate consecutive numbers by exactly one space, without trailing spaces.

Input

One line contains integer $n$.

Output

Print exactly $n$ rows.

Subtasks

• Subtask 1 (20%): $1\le n\le 5$.

• Subtask 2 (30%): $1\le n\le 15$.

• Subtask 3 (50%): $1\le n\le 30$.

Examples

Example 1

Input:

4

Output:

1 2 3 4
1 2 3
1 2
1

Explanation:

The row width decreases by one after each row.

Example 2

Input:

1

Output:

1

Explanation:

The row width decreases by one after each row.