#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1111, STD = 1000;
char o[MAXN * 2][MAXN];
int N, a[MAXN];
int main() {
  while (scanf("%d", &N) > 0) {
    for (int i = 1; i <= N; i++) scanf("%d", a + i);
    memset(o, ' ', sizeof(o));
    int nC = 0, nR = STD, dir = 1, up = STD, down = STD;
    for (int i = 1; i <= N; i++) {
      for (int j = 1; j <= a[i]; j++) {
        o[nR][nC] = dir == 1 ? '/' : '\\';
        nC++;
        if (j != a[i]) nR += dir;
        if (nR > up) up = nR;
        if (nR < down) down = nR;
      }
      dir = -dir;
    }
    for (int i = up; i >= down; i--) {
      o[i][nC] = '\0';
      printf("%s\n", o[i]);
    }
  }
  return 0;
}
