#include <bits/stdc++.h>
using namespace std;
const int N = 1111;
int x[N], y[N];
int a[N];
const int inf = ~0U >> 1;
struct Seg {
  int x, y, xx, yy;
  Seg() {}
  Seg(int a, int b, int c, int d) {
    x = a;
    y = b;
    xx = c;
    yy = d;
  }
  bool operator<(const Seg &o) const {
    if (x < o.x)
      return true;
    else if (x > o.x)
      return false;
    if (y < o.y)
      return true;
    else if (y > o.y)
      return false;
    if (xx < o.xx)
      return true;
    else if (xx > o.xx)
      return false;
    if (yy < o.yy) return true;
    return false;
  }
};
void solve(int n) {
  x[0] = 0;
  y[0] = 0;
  int sgn = 1;
  int l = 0, r = 0, u = 0, d = 0;
  set<Seg> se;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    x[i] = x[i - 1] + a[i];
    y[i] = y[i - 1] + sgn * a[i];
    l = min(l, x[i]);
    r = max(r, x[i]);
    u = max(u, y[i]);
    d = min(d, y[i]);
    int a = x[i - 1], b = y[i - 1];
    if (sgn == 1) {
      int na, nb;
      do {
        na = a + 1;
        nb = b + 1;
        se.insert(Seg(a, b, na, nb));
        a = na;
        b = nb;
      } while (na != x[i] && nb != y[i]);
    } else {
      a = x[i - 1], b = y[i - 1];
      int na, nb;
      do {
        na = a + 1;
        nb = b - 1;
        se.insert(Seg(a, b, na, nb));
        a = na;
        b = nb;
      } while (na != x[i] && nb != y[i]);
    }
    sgn = -sgn;
  }
  for (int y = u - 1; y >= d; y--) {
    for (int x = l; x <= r - 1;) {
      Seg a(x, y, x + 1, y + 1);
      Seg b(x, y + 1, x + 1, y);
      bool ok = false;
      if (se.count(a)) {
        printf("/");
        ok = true;
        x++;
      }
      if (se.count(b)) {
        printf("\\");
        ok = true;
        x++;
      }
      if (!ok) {
        printf(" ");
        x++;
      }
    }
    puts("");
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  while (cin >> n) solve(n);
  return 0;
}
