Under construction

Still being built. Things may change

Asterisks

Time limit1sMemory limit1024 MB

Summary
Print n lines where line k has k squared asterisks, capped at 100 with three dots appended when the count exceeds 100.
Level

Easy1 of 10

Topics
Implementation, Simulation
Solved
No attempts yet

Problem

Kolya likes drawing pictures out of asterisks. Today he decided to print nn lines, where the kk-th line must contain k2k^2 asterisks.

But then Kolya realized that printing too many asterisks is bad. So he decided that if a line must contain more than 100100 asterisks, he will print only 100100 asterisks in that line and then print three dots.

Help Kolya implement his plan.

Input

The input is a single integer nn (1≤n≤1001 \le n \le 100).

Output

Print nn lines according to Kolya's plan. Do not print spaces.

Examples1

  1. Example 1

    Input
    3
    
    Expected output
    *
    ****
    *********