#include <bits/stdc++.h>
double const PI = acos(-1);
double const E = exp(1);
using namespace std;
int arr[1005][1005], n, i, j, k, a[1005], b[1005], mn, mx, sum;
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &b[i]);
    a[i] = a[i - 1] + ((i % 2) ? b[i] : -b[i]);
    mn = min(mn, a[i]);
    mx = max(mx, a[i]);
    sum += b[i];
  }
  i = -mn;
  j = 0;
  for (k = 1; k <= n; k++) {
    while (b[k]--) {
      if (k % 2)
        arr[++i][++j] = 1;
      else
        arr[i--][++j] = -1;
    }
  }
  for (i = mx - mn; i > 0; i--, printf("\n"))
    for (j = 1; j <= sum; j++)
      printf("%c", (arr[i][j] == 1) ? '/' : ((arr[i][j] == -1) ? '\\' : ' '));
}
