Problem F. 7. Mountains
Input file name: standard input
Output file name: standard output
Time limit: 1 s
Memory limit: 1024 MB

When climbing the mountains, Petriukas would record numbers one after another: how much he ascended, how much he descended, how much he ascended, how much he descended, and so on.

Help represent Petriukas’ journey through the mountains.

Input

A natural number n representing the quantity of numbers Petriukas recorded, and natural numbers Ai representing the recorded numbers (1 ≤ n ≤ 1000, 1 ≤ Ai ≤ 1000).

Output

Represent the journey in a rectangular table composed of dots and slashes.
In the first and last rows and the first and last columns, there must be at least one slash.

Examples

standard input standard output
5
3 1 2 5 1




3
1 5 1