Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Cardiogram

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn this problem, your task is to use ASCII graphics to paint a cardiogram.

A cardiogram is a polyline with the following corners:

That is, a cardiogram is fully defined by a sequence of positive integers *a*_{1}, *a*_{2}, ..., *a*_{n}.

Your task is to paint a cardiogram by given sequence *a*_{i}.

Input

The first line contains integer *n* (2 ≤ *n* ≤ 1000). The next line contains the sequence of integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 1000). It is guaranteed that the sum of all *a*_{i} doesn't exceed 1000.

Output

Print *max* |*y*_{i} - *y*_{j}| lines (where *y*_{k} is the *y* coordinate of the *k*-th point of the polyline), in each line print characters. Each character must equal either « / » (slash), « \ » (backslash), « » (space). The printed image must be the image of the given polyline. Please study the test samples for better understanding of how to print a cardiogram.

Note that in this problem the checker checks your answer taking spaces into consideration. Do not print any extra characters. Remember that the wrong answer to the first pretest doesn't give you a penalty.

Examples

Input

5

3 1 2 5 1

Output

/ \

/ \ / \

/ \

/ \

\ /

Input

3

1 5 1

Output

/ \

\

\

\

\ /

Note

Due to the technical reasons the answers for the samples cannot be copied from the statement. We've attached two text documents with the answers below.

http://assets.codeforces.com/rounds/435/1.txt

http://assets.codeforces.com/rounds/435/2.txt

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/12/2021 04:13:54 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|