#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int N;
int a[1000];
int p[2000];
char fld[2000][2000];
int main(void) {
  cin >> N;
  for (int i = 0; i < (int)(N); ++i) cin >> a[i];
  for (int i = 0; i < (int)(N); ++i)
    p[i + 1] = p[i] + (i % 2 == 0 ? -a[i] : a[i]);
  int mn = INF;
  for (int i = 0; i < (int)(N + 1); ++i) mn = min(mn, p[i]);
  for (int i = 0; i < (int)(N + 1); ++i) p[i] -= mn;
  vector<pair<int, char> > res;
  for (int i = 0; i < (int)(N); ++i) {
    if (p[i] > p[i + 1])
      for (int j = 0; j < (int)(p[i] - p[i + 1]); ++j)
        res.push_back(pair<int, char>(p[i] - j - 1, '/'));
    else
      for (int j = 0; j < (int)(p[i + 1] - p[i]); ++j)
        res.push_back(pair<int, char>(p[i] + j, '\\'));
  }
  int R = 0, W = 0;
  for (int i = 0; i < (int)(N + 1); ++i) R = max(R, p[i]);
  for (int i = 0; i < (int)(N); ++i) W += a[i];
  for (int i = 0; i < (int)(R); ++i)
    for (int j = 0; j < (int)(W); ++j) fld[i][j] = ' ';
  for (int j = 0; j < (int)(res.size()); ++j)
    fld[res[j].first][j] = res[j].second;
  for (int i = 0; i < (int)(R); ++i) {
    for (int j = 0; j < (int)(W); ++j) cout << fld[i][j];
    cout << endl;
  }
  return 0;
}
