Problem: 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. 

Input

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. 

Output

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

Examples

Input

8
[[][]][]


Output

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


Input

6
[[[]]]


Output

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


Input

6
[[][]]


Output

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


Input

2
[]


Output

+- -+
|   |
+- -+


Input

4
[][]


Output

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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int flag;
int arr[2000];
int papad;
int find_max_level(string s) {
  int i, counter = 0, maxi = -1;
  for (i = 0; i < s.length(); i++) {
    if (s[i] == '[')
      counter++;
    else
      counter--;
    maxi = max(maxi, counter);
  }
  return maxi;
}
string cheker(string s, int val) {
  flag = 0;
  string str = " ";
  int i, counter = 0;
  for (i = 0; i < papad + 2; i++) {
    str += ' ';
  }
  for (i = 0; i < s.length(); i++) {
    if (s[i] == '[') {
      if (counter < val) {
        str[arr[i]] = '|';
      } else if (counter == val) {
        flag = 1;
        str[arr[i]] = '+';
        str[arr[i] + 1] = '-';
      }
      counter++;
    } else {
      counter--;
      if (counter < val) {
        str[arr[i]] = '|';
      } else if (counter == val) {
        str[arr[i]] = '+';
        str[arr[i] - 1] = '-';
      }
    }
  }
  str = str.substr(0, papad);
  cout << str << "\n";
  return str;
}
string computemid(string s) {
  int j = 0, i;
  string s1 = "";
  for (i = 0; i < s.length(); i++) {
    if (s[i] == '[') {
      s1 += "|";
      arr[i] = j;
      j++;
    } else {
      if (s[i - 1] == '[') {
        s1 += "   ";
        j += 3;
        s1 += "|";
        arr[i] = j;
        j++;
      } else {
        s1 + "|";
        arr[i] = j;
        j++;
      }
    }
  }
  papad = j;
  return s1;
}
int main() {
  std::ios::sync_with_stdio(false);
  int n;
  cin >> n;
  string s;
  cin >> s;
  find_max_level(s);
  string middle = computemid(s);
  int counter = 0;
  stack<string> sta;
  flag = 1;
  while (flag) {
    string str = cheker(s, counter);
    if (flag) {
      sta.push(str);
    }
    counter++;
  }
  while (!sta.empty()) {
    cout << sta.top() << "\n";
    sta.pop();
  }
  return 0;
}