Inverted Pyramid Pattern

Given an integer \(n\), output an inverted pyramid pattern of asterisks with \(n\) rows. For each row \(i\) (starting from 0), the number of asterisks is determined by the formula \(2*(n - i) - 1\) and is preceded by \(i\) spaces. If \(n\) is less than 1, the program should output an empty string.

Example:

Input: 4
Output:
*******
 *****
  ***
   *

inputFormat

The input consists of a single integer \(n\) provided via standard input (stdin), where \(n\) indicates the number of rows in the inverted pyramid.

outputFormat

Print the inverted pyramid pattern corresponding to the provided integer \(n\). Each row must be printed on a new line, and care must be taken to include the correct number of leading spaces followed by asterisks as determined by \(2*(n-i)-1\) for the \(i^{th}\) row.

0