Inverted Number Pyramid

Given a positive integer \( n \in \mathbb{N^+} \), print an inverted pyramid of numbers. In the pyramid, the first line contains the number n repeated n times, the second line contains the number (n-1) repeated (n-1) times, and so forth until you reach 1.

For example, if \( n = 5 \), the output should be:

55555
4444
333
22
1

This problem tests your ability to use loops and string manipulation in a straightforward yet illustrative manner.

inputFormat

The input consists of a single integer \( n \) (\( 1 \leq n \leq 1000 \)). This integer represents the height of the pyramid.

outputFormat

Print the inverted pyramid. Each line \( i \) (starting from \( n \) down to 1) should contain the digit \( i \) repeated \( i \) times. Ensure that each line is printed on a new line.

## sample

5

55555
4444
333
22
1

</p>