Hollow Diamond


Submit solution

Points: 10
Time limit: 1.0s
Memory limit: 256M

Author:
Problem types

Given a positive integer n, print a hollow diamond. The upper half has n rows and the lower half has n - 1 rows.

Input

  • One positive integer n.

Output

  • Use * and leading spaces. Do not print trailing spaces.

Constraints

  • 2 <= n <= 50

Example

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

Comments

There are no comments at the moment.