Inverted Right-Angled Triangle Pattern

Given a positive integer \( n \), print an inverted right-angled triangle pattern made of asterisks. The first row must have \( n \) asterisks, the second row must have \( n-1 \) asterisks, and so on until the last row has 1 asterisk.

Example:

Input: 5
Output:
*****
****
***
**
*

Each row \( i \) (with \( 1 \leq i \leq n \)) contains \( n-i+1 \) asterisks.

inputFormat

The input consists of a single integer \( n \) (\(1 \leq n \leq 100\)) representing the number of asterisks in the first row.

outputFormat

The output should contain \( n \) lines. The \( i^{th} \) line from the top should contain \( n-i+1 \) asterisks, forming an inverted right-angled triangle.

## sample

5

*****


**
*

</p>