#include <bits/stdc++.h>
using namespace std;
int main() {
  int mtr[2000][1000] = {0};
  int upl, lowl;
  int ii, jj;
  upl = lowl = ii = 1000;
  jj = 0;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int num;
    cin >> num;
    for (int j = 0; j < num; j++)
      if (i % 2)
        mtr[ii + j][jj + j] = 1;
      else
        mtr[ii - j][jj + j] = -1;
    if (i % 2)
      ii += num - 1;
    else
      ii -= num - 1;
    jj += num;
    upl = min(upl, ii);
    lowl = max(lowl, ii);
  }
  for (int i = upl; i <= lowl; i++) {
    for (int j = 0; j < jj; j++) switch (mtr[i][j]) {
        case 0:
          cout << ' ';
          break;
        case 1:
          cout << '\\';
          break;
        case -1:
          cout << '/';
          break;
      }
    cout << endl;
  }
  return 0;
}
