#include <bits/stdc++.h>
char mp[1111][1111];
int pos[1111], str[1111];
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    scanf("%d", &str[0]);
    int p1 = 0, p2 = 0, o1, o2, ttt = str[0];
    memset(mp, ' ', sizeof(mp));
    int top = str[0], bot = str[0], sum = str[0], all = str[0], z = str[0], p;
    for (int i = 1; i < n; i++) {
      scanf("%d", &str[i]);
      ttt += str[i];
      if (i & 1) {
        sum -= str[i];
        all += str[i];
      } else {
        sum += str[i];
        all += str[i];
      }
      if (sum > top) top = sum, z = all, p1 = i, p2 = i;
      if (sum < bot) bot = sum, o1 = i, o2 = i;
    }
    int x = 0, y = z - 1, flag = 0;
    while (p1 >= 0) {
      for (int i = 0; i < str[p1]; i++) {
        if (!flag) {
          mp[x][y] = '/';
          if (i == str[p1] - 1) continue;
          x++, y--;
        } else {
          mp[x][y] = '\\';
          if (i == str[p1] - 1) continue;
          x--, y--;
        }
      }
      y--;
      flag = !flag;
      p1--;
    }
    p2++;
    x = 0, y = z;
    flag = 0;
    while (p2 < n) {
      for (int i = 0; i < str[p2]; i++) {
        if (!flag) {
          mp[x][y] = '\\';
          if (i == str[p2] - 1) continue;
          x++, y++;
        } else {
          mp[x][y] = '/';
          if (i == str[p2] - 1) continue;
          x--, y++;
        }
      }
      y++;
      flag = !flag;
      p2++;
    }
    int zxc = top;
    if (top - bot > zxc) zxc = top - bot;
    for (int i = 0; i < zxc; i++) {
      for (int j = 0; j < ttt; j++) printf("%c", mp[i][j]);
      printf("\n");
    }
  }
  return 0;
}
