Position-Based Number Triangle

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given $n$, print exactly $n$ rows. Row $i$ contains integers $1,2,\ldots,i$ in increasing order, separated by one space without leading or trailing spaces.

Input

One line contains integer $n$.

Output

Print the triangle in exactly $n$ lines.

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:

3

Output:

1
1 2
1 2 3

Explanation:

Row i contains 1 through i.

Example 2

Input:

1

Output:

1

Explanation:

Row i contains 1 through i.