#include <bits/stdc++.h>
using namespace std;
int x[1002];
char grid[1002][1002];
int main() {
  memset(grid, ' ', sizeof grid);
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x[i]);
  }
  int mx = 0, mn = 100000;
  int s = 0;
  int y = 0;
  for (int i = 0; i < n; i++) {
    s += x[i];
    if (i % 2 != 0) {
      y -= x[i] - 1;
    } else {
      y += x[i] - 1;
    }
    if (y > mx) {
      mx = y;
    }
    if (y < mn) {
      mn = y;
    }
  }
  int xx = mx, yy = 0;
  for (int i = 0; i < n; i++) {
    if (i % 2 != 0) {
      for (int k = 0; k < x[i]; k++) {
        grid[xx][yy] = 92;
        grid[xx][s] = 0;
        xx++;
        yy++;
      }
      xx--;
    } else {
      for (int k = 0; k < x[i]; k++) {
        grid[xx][yy] = '/';
        grid[xx][s] = 0;
        xx--;
        yy++;
      }
      xx++;
    }
  }
  mn = min(mn, 0);
  for (int i = 0; i < mx - mn + 1; i++) {
    printf("%s\n", grid[i]);
  }
  return 0;
}
