#include <bits/stdc++.h>
int n, a[1005], maxi[1005];
char map[1005][1005];
int main() {
  int i, j, max, min, maxy, miny, cur, f, x, y;
  char ch;
  scanf("%d", &n);
  cur = 0;
  f = -1;
  max = 0, min = 0;
  memset(map, ' ', sizeof(map));
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    f *= -1;
    cur += f * a[i];
    if (cur > max) {
      max = cur;
      maxy = i;
    }
    if (cur < min) {
      min = cur;
      miny = i;
    }
  }
  y = max - min;
  cur = 0;
  f = 1;
  for (i = maxy; i >= 0; i--) {
    cur += f * a[i];
    f *= -1;
  }
  cur--;
  x = 0;
  ch = '\\';
  f = -1;
  for (i = 0; i < n; i++) {
    if (ch == '\\')
      ch = '/';
    else
      ch = '\\';
    for (j = 0; j < a[i]; j++) {
      if (j != 0) cur += f;
      map[cur][x] = ch;
      x++;
    }
    f *= -1;
  }
  for (i = 0; i < y; i++) {
    for (j = 0; j < x; j++) {
      printf("%c", map[i][j]);
    }
    printf("\n");
  }
  return 0;
}
