#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000000,100000000000")
const long long INF = 1000000007;
const double cp = 2 * asin(1.0);
const double eps = 1e-9;
const long long mod = 1000000007LL;
using namespace std;
long long tn(long long x) {
  x += 1001;
  return x;
}
int main() {
  long long n, a[1001], x = 0, y = 0, s = 0, t = 0, mxy = 0, mny = 1e9, s1 = 0;
  vector<vector<char> > f(2003);
  cin >> n;
  for (int(i) = 0; (i) < (n); i++) {
    cin >> a[i];
    s1 += a[i];
  }
  for (int(i) = 0; (i) < (2002); i++)
    for (int(j) = 0; (j) < (2002); j++) f[i].push_back(' ');
  for (int(q) = 0; (q) < (n); q++) {
    s += a[q];
    if (q % 2)
      t -= a[q];
    else
      t += a[q];
    if (y < t) {
      for (int(i) = (x); (i) <= (s - 1); i++) {
        mny = min(mny, tn(y));
        mxy = max(mxy, tn(y));
        f[i][tn(y)] = '/';
        y++;
      }
      y--;
    } else {
      for (int(i) = (x); (i) <= (s - 1); i++) {
        mny = min(mny, tn(y));
        mxy = max(mxy, tn(y));
        f[i][tn(y)] = char(92);
        y--;
      }
      y++;
    }
    x = s;
  }
  for (int(i) = (mxy); (i) >= (mny); i--) {
    bool k = true;
    for (int(j) = 0; (j) < (s); j++) {
      cout << f[j][i];
    }
    cout << endl;
  }
  return 0;
}
