#include <bits/stdc++.h>
using namespace std;
const int maxn = 1001;
int N, a[maxn];
char s[maxn << 2][maxn << 2];
int main() {
  scanf("%d", &N);
  int maxVal = 0, minVal = 0;
  for (int i = 1, d = 1, val = 0; i <= N; ++i, d *= -1) {
    scanf("%d", &a[i]);
    val += a[i] * d;
    maxVal = max(maxVal, val);
    minVal = min(minVal, val);
  }
  int cnt = 0;
  for (int i = 1, d = 1, val = 0; i <= N; ++i, d *= -1) {
    int netVal = val + d * a[i];
    int st = maxVal - val, ed = maxVal - netVal;
    if (netVal < val) {
      for (int j = st; j < ed; ++j) {
        s[j][cnt++] = '\\';
      }
    } else {
      for (int j = st - 1; j >= ed; --j) {
        s[j][cnt++] = '/';
      }
    }
    val = netVal;
  }
  for (int i = 0; i <= maxVal - minVal; ++i) {
    for (int j = 0; j < cnt; ++j) {
      printf("%c", s[i][j] == '\0' ? ' ' : s[i][j]);
    }
    if (i != maxVal - minVal) {
      printf("\n");
    }
  }
  return 0;
}
