#include <bits/stdc++.h>
using namespace std;
vector<pair<char, int> > v[3000006];
int a[1005];
int main() {
  int n, t = 0;
  cin >> n;
  int up = 1500000, down = 1500000, now = 1500000;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    while (a[i]) {
      if (i & 1)
        v[now].push_back({'\\', t}), now -= 1;
      else
        v[now].push_back({'/', t}), now += 1;
      t++;
      a[i]--;
    }
    if (i & 1)
      now++;
    else
      now--;
    down = min(down, now);
    up = max(up, now);
  }
  for (int i = up; i >= down; i--) {
    int tt = 0;
    for (int j = 0; j < t; j++) {
      if (tt >= v[i].size() || j != v[i][tt].second)
        cout << ' ';
      else
        cout << v[i][tt].first, tt++;
    }
    cout << '\n';
  }
  return 0;
}
