#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  vector<bool> a(n);
  vector<int> deep(n);
  char mp[1000][1000];
  for (int i = 0; i < 1000; ++i)
    for (int j = 0; j < 1000; ++j) mp[i][j] = ' ';
  for (int i = 0; i < n; ++i) {
    char q;
    cin >> q;
    a[i] = (q == '[') ? 0 : 1;
  }
  stack<int> st;
  int mx = 0;
  for (int i = 0; i < n; ++i) {
    (a[i] == 0) ? st.push(0) : st.pop();
    (a[i] == 1) ? deep[i] = st.size() + 1 : deep[i] = st.size();
    mx = max(mx, deep[i]);
  }
  int last = 0;
  for (int i = 0; i < n; ++i) {
    int cur = deep[i];
    if (a[i] == 0) {
      mp[cur - 1][last + 1] = '-';
      mp[2 * mx - cur + 1][last + 1] = '-';
      mp[cur - 1][last] = '+';
      mp[2 * mx - cur + 1][last] = '+';
      for (int j = cur; j < 2 * mx - cur + 1; ++j) {
        mp[j][last] = '|';
      }
      if (a[i + 1] == 1) {
        last += 4;
      } else {
        ++last;
      }
    } else {
      mp[cur - 1][last - 1] = '-';
      mp[2 * mx - cur + 1][last - 1] = '-';
      mp[cur - 1][last] = '+';
      mp[2 * mx - cur + 1][last] = '+';
      for (int j = cur; j < 2 * mx - cur + 1; ++j) {
        mp[j][last] = '|';
      }
      ++last;
    }
  }
  for (int i = 0; i < 2 * mx + 1; ++i) {
    for (int j = 0; j < last; ++j) {
      cout << mp[i][j];
    }
    if (i != 2 * mx) cout << "\n";
  }
  return 0;
}
