Left Star Triangle

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given $n$, print $n$ rows of *; row $i$ (1-indexed) contains exactly $i$ consecutive asterisks, with no spaces.

Input

One line contains integer $n$.

Output

Print exactly $n$ rows, row $i$ consisting of $i$ asterisks.

Subtasks

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

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

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

Examples

Example 1

Input:

4

Output:

*
**
***
****

Explanation:

The number of stars on row i is i. For this sample, the input is 4; the displayed rows follow these rules exactly.

Example 2

Input:

1

Output:

*

Explanation:

The number of stars on row i is i. For this sample, the input is 1; the displayed rows follow these rules exactly.