#include <bits/stdc++.h>
using namespace std;
int m[1002][1002];
int a[1002];
int b[1002][2];
int main(void) {
  int n;
  int yma, ymi;
  scanf("%d", &n);
  int p = -1;
  b[0][0] = 0;
  b[0][1] = 0;
  yma = ymi = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    p *= -1;
    b[i + 1][0] = b[i][0] + a[i];
    b[i + 1][1] = b[i][1] + p * a[i];
    if (b[i + 1][1] > yma)
      yma = b[i + 1][1];
    else if (b[i + 1][1] < ymi)
      ymi = b[i + 1][1];
  }
  for (int i = 0; i < n; ++i) {
    int tmp = yma - b[i][1];
    if (b[i + 1][1] > b[i][1]) {
      for (int j = b[i][0]; j < b[i + 1][0]; ++j) {
        m[tmp - 1][j] = 1;
        --tmp;
      }
    } else {
      for (int j = b[i][0]; j < b[i + 1][0]; ++j) {
        m[tmp][j] = -1;
        ++tmp;
      }
    }
  }
  for (int j = 0; j < (yma - ymi); ++j) {
    for (int i = 0; i < b[n][0]; ++i) {
      if (m[j][i] == -1)
        printf("\\");
      else if (m[j][i] == 1)
        printf("/");
      else
        printf(" ");
    }
    printf("\n");
  }
  return 0;
}
