#K13371. Diamond Pattern

    ID: 23898 Type: Default 1000ms 256MiB

Diamond Pattern

Diamond Pattern

Given an odd integer \(n\) satisfying \(3 \le n \le 19\), print a diamond pattern composed of '*' characters. The diamond is symmetric along its center.

For example, when \(n = 3\), the output should be:

 *
***
 *

And when \(n = 5\), the output should be:

  *
 ***
*****
 ***
  *

Ensure that the output format exactly matches the required pattern with appropriate leading spaces.

inputFormat

The input consists of a single integer \(n\) (an odd integer where \(3 \le n \le 19\)). This integer represents the size of the diamond.

outputFormat

Output the corresponding diamond pattern. Each line should be centered with the correct number of leading spaces and exactly \(2k+1\) '*' characters in the \(k^{th}\) row of the diamond structure.

## sample
3
 *

</p>