#include <bits/stdc++.h>
using namespace std;
map<int, vector<pair<int, char> > > m;
int arr[1010];
int main() {
  int maxup = 3000;
  int maxdown = 3000;
  int cur = 3000;
  int N;
  cin >> N;
  for (int i = 0; i < N; i++) cin >> arr[i];
  int l = 0;
  for (int i = 0; i < N; i++) {
    int d = arr[i];
    while (d--) {
      if (i % 2) {
        m[cur++].push_back(make_pair(l++, '\\'));
        if (!d) cur--;
      } else {
        m[cur--].push_back(make_pair(l++, '/'));
        if (!d) cur++;
      }
    }
    maxup = min(maxup, cur);
    maxdown = max(maxdown, cur);
  }
  for (int i = maxup; i <= maxdown; i++) {
    vector<pair<int, char> > v = m[i];
    map<int, char> vis;
    for (int i = 0; i < int((v).size()); i++) vis[v[i].first] = v[i].second;
    for (int i = 0; i < l; i++) {
      if (!vis.count(i))
        cout << " ";
      else
        cout << vis[i];
    }
    cout << endl;
  }
}
