#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 100;
char g[2000][2000];
int aa[1000 + 10], x[1000 + 10], y[1000 + 10];
int s[] = {-1, 1};
int ymax = -1;
int amax = 0;
int ymin = 1e9;
int xmax = -1;
int xmin = -1;
int a, b;
void print() {
  for (int i = 0; i <= amax; i++) {
    for (int j = 0; j <= b - 1; j++) {
      printf("%c", g[i][j]);
    }
    puts("");
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &aa[i]);
  }
  for (int i = 1; i <= n; i++) {
    x[i] = x[i - 1] + aa[i];
  }
  for (int i = 1; i <= n; i++) {
    xmax = max(xmax, x[i]);
  }
  for (int i = 1; i <= n; i++) {
    y[i] = y[i - 1] + s[(i & 1)] * (aa[i]);
  }
  for (int i = 1; i <= n; i++) {
    ymax = max(ymax, y[i]);
    ymin = min(ymin, y[i]);
  }
  b = 0;
  a = ymax - 1;
  amax = max(a, amax);
  memset(g, ' ', sizeof(g));
  for (int i = 1; i <= n; i++) {
    if ((i & 1)) {
      for (int q = 0; q <= aa[i] - 1; q++) {
        g[a - q][b + q] = '/';
      }
      a -= (aa[i] - 1);
      amax = max(amax, a);
      b += (aa[i] - 1);
      b++;
    } else {
      for (int q = 0; q <= aa[i] - 1; q++) {
        g[a + q][b + q] = '\\';
      }
      a += (aa[i] - 1);
      amax = max(amax, a);
      b += (aa[i] - 1);
      b++;
    }
  }
  print();
  return 0;
}
