#include <bits/stdc++.h>
using namespace std;
int n;
int mas[1010];
int point[1010][2];
char **res;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> mas[i];
  }
  int len = 0;
  int maxy = 0, miny = 0;
  point[0][0] = point[0][1] = 0;
  for (int i = 1; i <= n; ++i) {
    point[i][0] = point[i - 1][0] + mas[i - 1];
    point[i][1] = point[i - 1][1] + mas[i - 1] * (i % 2 == 0 ? -1 : 1);
    len += mas[i - 1];
    maxy = max(maxy, point[i][1]);
    miny = min(miny, point[i][1]);
  }
  int sizex = len;
  int sizey = maxy - miny;
  res = new char *[sizey + 10];
  for (int i = 0; i < sizey; ++i) {
    res[i] = new char[sizex + 10];
    memset(res[i], ' ', sizex);
    res[i][sizex] = '\0';
  }
  int x = 0, y = 0;
  for (int i = 1; i < n + 1; ++i) {
    int cx = maxy - point[i - 1][1] + (i % 2 == 0 ? 0 : -1),
        cy = point[i - 1][0];
    for (int j = x; j < point[i][0]; ++j) {
      if (point[i][1] > y) {
        res[cx][cy] = '/';
        cx--;
        cy++;
      } else {
        res[cx][cy] = '\\';
        cx++;
        cy++;
      }
    }
    x = point[i][0];
    y = point[i][1];
  }
  for (int i = 0; i < sizey; ++i) {
    cout << res[i] << endl;
  }
  return 0;
}
