#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<pair<int, int>> points;
  points.push_back({0, 0});
  int x = 0, y = 0, low = INT_MAX, high = INT_MIN;
  for (int i = 0; i < n; i++) {
    x += a[i];
    y += (a[i] * (i % 2 == 0 ? 1 : -1));
    points.push_back({x, y});
  }
  for (auto p : points) {
    low = min(low, p.second);
    high = max(high, p.second);
  }
  vector<string> v;
  for (int i = 0; i < high - low; i++) {
    string s;
    for (int j = 0; j < (int)(points.back()).first; j++) {
      s += " ";
    }
    v.push_back(s);
  }
  int idx1 = high - 1, idx2 = 0;
  for (int i = 1; i < (int)points.size(); i++) {
    int add_x = points[i].first - points[i - 1].first;
    int add_y = points[i].second - points[i - 1].second;
    for (int j = 0; j < add_x; j++) {
      v[idx1][idx2] = (add_y > 0 ? '/' : '\\');
      idx1 += (add_y > 0 ? -1 : 1);
      idx2++;
    }
    idx1 = idx1 + (add_y > 0 ? 1 : -1);
  }
  for (int i = 0; i < (int)v.size(); i++) {
    cout << v[i] << "\n";
  }
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
