CF770D.Draw Brackets!

A sequence of square brackets is regular if by inserting symbols "+" and "1" into it, you can get a regular mathematical expression from it. For example, sequences "[[]][]", "[]" and "[[][[]]]" — are regular, at the same time "][", "[[]" and "[[]]][" — are irregular.

Draw the given sequence using a minimalistic pseudographics in the strip of the lowest possible height — use symbols '+', '-' and '|'. For example, the sequence "[[][]][]" should be represented as:

+- -- -+
|+- -- -+|| |
|| || ||| |
|+- -- -+|| |
+- -- -+

Each bracket should be represented with the hepl of one or more symbols '|' (the vertical part) and symbols '+' and '-' as on the example which is given above.

Brackets should be drawn without spaces one by one, only dividing pairs of consecutive pairwise brackets with a single-space bar (so that the two brackets do not visually merge into one symbol). The image should have the minimum possible height.

The enclosed bracket is always smaller than the surrounding bracket, but each bracket separately strives to maximize the height of the image. So the pair of final brackets in the example above occupies the entire height of the image.

Study carefully the examples below, they adequately explain the condition of the problem. Pay attention that in this problem the answer (the image) is unique.

如果通过在方括号序列中插入符号 “+” 和 “1”，能够得到一个合法的数学表达式，则称该方括号序列为正规的。例如，序列 [[]][:]、[] 和 [[[][[]]]] 是正规的；而 ][、[[ 和 [][]][ 是不正规的。

请用极简风格的伪图形（pseudographics）在尽可能低的高度的条带中绘制给定的序列——仅使用符号 +、- 和 |。例如，序列 [[][]][] 应表示为：

+- -++- -+   
|+- -++- -+|| |  
|| || ||| |  
|+- -++- -+|| |  
+- -++- -+  

每个方括号应由一个或多个符号 |（竖直部分）以及符号 + 和 - 组成，具体形式如上例所示。

方括号应无空格地依次绘制，仅在每对相邻的方括号之间插入一个空格（以确保两个方括号在视觉上不融合为单个符号）。整个图像应具有最小可能的高度。

被嵌套的方括号总比其外层方括号更小，但每个方括号本身都力求使图像高度最大化。因此，上述示例中最外层的一对方括号占据了整个图像的高度。

请仔细研究下面的示例，它们充分阐明了本题的要求。注意：本题的答案（即所生成的图像）是唯一的。

The first line contains an even integer n (2 ≤ n ≤ 100) — the length of the sequence of brackets.

The second line contains the sequence of brackets — these are n symbols "[" and "]". It is guaranteed that the given sequence of brackets is regular.

第一行包含一个偶数 $n$（$2 \leq n \leq 100$）—— 表示括号序列的长度。

第二行包含括号序列 —— 这是 $n$ 个符号 "[" 和 "]"。保证给定的括号序列是合法的（regular）。

Print the drawn bracket sequence in the format which is given in the condition. Don't print extra (unnecessary) spaces.

按照题目条件中给出的格式输出所绘制的括号序列。不要输出额外的（不必要的）空格。