Construction Site Sign

Time limit1sMemory limit512 MB

Summary

Given N, print an N by N no-entry sign pattern.

Level: Easy1 of 10
Topics: Implementation
Solved: No attempts yet

Problem

Baeknam, a freshman, was walking around the wide Chungnam National University campus and saw many places under construction for new buildings.

Construction sites have many dangerous elements, so Baeknam could get hurt. He must be kept from entering them.

Let us make a no-entry sign for Baeknam's safety.

Input

The first line gives the integer $N$ ( $1\leq N \leq 20$ ).

Output

Print a no-entry sign of size $N\times N$ .

Examples3

Example 1
Input
```
1
```
Expected output
```
*
```
Example 2
Input
```
5
```
Expected output
```
*****
** **
* * *
** **
*****
```

Example 3

Input

Expected output

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