#include <bits/stdc++.h>
using namespace std;
struct pii {
  int first;
  int second;
  char ok;
};
vector<pii> P;
bool mycomp(pii a, pii b) {
  return (a.second > b.second || (a.second == b.second && a.first < b.first));
}
int main() {
  int n;
  cin >> n;
  int x = -1;
  int y = -1;
  for (int i = 1; i <= n; i++) {
    int v;
    cin >> v;
    if (i % 2) {
      for (int j = 1; j <= v; j++) {
        x++;
        y++;
        pii news;
        news.first = x;
        news.second = y;
        news.ok = '/';
        P.push_back(news);
      }
      y++;
    } else {
      for (int j = 1; j <= v; j++) {
        x++;
        y--;
        pii news;
        news.first = x;
        news.second = y;
        news.ok = '\\';
        P.push_back(news);
      }
      y--;
    }
  }
  sort(P.begin(), P.end(), mycomp);
  int s = x;
  int k = 0;
  for (int h = P[0].second; h >= P[P.size() - 1].second; h--) {
    for (int j = 0; j <= s; j++) {
      if (k < P.size() && j == P[k].first && P[k].second == h)
        cout << P[k].ok, k++;
      else
        cout << ' ';
    }
    cout << endl;
  }
}
