#include <bits/stdc++.h>
using namespace std;
int a[2005], gd[2005][2005], last[2005];
int main() {
  int i, j, n, x = 0, mx = 0, my = 0, t = 1, nx, ny, r, s = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    x = x + t * a[i];
    s += a[i];
    t = t * (-1);
    mx = max(mx, x);
    my = min(my, x);
  }
  nx = mx - 1;
  ny = 0;
  t = 1;
  for (i = 0; i < n; i++) {
    int u = a[i];
    while (u--) {
      gd[nx][ny] = t;
      nx = nx - t;
      ++ny;
    }
    nx = nx + t;
    t = t * (-1);
  }
  r = mx - my;
  for (i = 0; i < r; i++) {
    for (j = 0; j < s; j++) {
      if (gd[i][j] == 1)
        cout << "/";
      else if (gd[i][j] == -1)
        cout << "\\";
      else
        cout << " ";
    }
    cout << "\n";
  }
}
