# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

## Full Pyramid

Limits: 1s, 512 MB

Given an integer **N**, print a full pyramid of asterisks.

A full pyramid of asterisks of size N has N lines of asterisks. The first line has 1 asterisk, the second line has 2 asterisks, the third line has 3 asterisks and so on. Each asterisk has a space between them. The asterisks in each line are centered so as to make it look like a pyramid.

Here is a full pyramid of asterisks of size 4:

```
*
* *
* * *
* * * *
```

#### Input

The input will contain an integer **N** (0 < N < 100).

#### Output

Print the full pyramid of asterisks of the given size.

Do not print any space after the last asterisk in each line.

#### Samples

Input | Output |
---|---|

3 | * * * * * * |

Login to submit