#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} p[1100];
int a[1100];
char s[2100][2100];
int main() {
  int i, j, k, n, m, maxn, minn;
  memset(s, 0, sizeof(s));
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  p[0].x = p[0].y = 0;
  maxn = 0;
  minn = 0;
  for (i = 1; i <= n; i++) {
    p[i].x = p[i].y = 0;
    for (j = 1; j <= i; j++) p[i].x += a[j];
    for (j = 1; j <= i; j++) {
      if (j & 1)
        p[i].y += a[j];
      else
        p[i].y -= a[j];
      maxn = ((maxn) > (p[i].y) ? (maxn) : (p[i].y));
      minn = ((minn) < (p[i].y) ? (minn) : (p[i].y));
    }
  }
  for (i = 0; i <= n; i++) p[i].y += (-minn);
  maxn += (-minn);
  int x = p[0].x, y = p[0].y;
  for (i = 1; i <= n; i++) {
    if (i & 1) {
      for (j = 0; j < a[i]; j++) {
        s[x++][y++] = '/';
      }
      y--;
    } else {
      for (j = 0; j < a[i]; j++) {
        s[x++][y--] = '\\';
      }
      y++;
    }
  }
  for (i = maxn - 1; i >= 0; i--) {
    for (j = 0; j < p[n].x; j++) {
      if (s[j][i] != 0)
        printf("%c", s[j][i]);
      else
        printf(" ");
    }
    puts("");
  }
}
