#include <bits/stdc++.h>
using namespace std;
deque<vector<int> > de;
int n;
int A[1005];
void init() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> A[i];
}
void len(int& k, int& m, int so) {
  de[k].push_back(m);
  while (so > 1) {
    so--;
    m++;
    if (k == 0) {
      vector<int> tmp;
      tmp.push_back(m);
      de.push_front(tmp);
    } else {
      k--;
      de[k].push_back(m);
    }
  }
}
void xuong(int& k, int& m, int so) {
  de[k].push_back(-m);
  while (so > 1) {
    so--;
    m++;
    if (k == de.size() - 1) {
      vector<int> tmp;
      tmp.push_back(-m);
      de.push_back(tmp);
      k++;
    } else {
      k++;
      de[k].push_back(-m);
    }
  }
}
void process() {
  int m = 1, k = 0;
  vector<int> hehe;
  de.push_back(hehe);
  for (int i = 0; i < n; i++)
    if (i & 1) {
      xuong(k, m, A[i]);
      m++;
    } else {
      len(k, m, A[i]);
      m++;
    }
}
void show() {
  int Max = -1;
  for (int i = 0; i < de.size(); i++) Max = max(Max, abs(de[i].back()));
  for (int i = 0; i < de.size(); i++) {
    int tmp = 0;
    for (int j = 1; j <= Max; j++) {
      if (tmp < de[i].size() && j == de[i][tmp]) {
        cout << "/";
        tmp++;
      } else if (tmp < de[i].size() && j == -de[i][tmp]) {
        cout << "\\";
        tmp++;
      } else
        cout << " ";
    }
    if (i != de.size() - 1) cout << endl;
  }
}
void show2() {
  for (int i = 0; i < de.size(); i++) {
    for (int j = 0; j < de[i].size(); j++) cout << de[i][j] << " ";
    cout << endl;
  }
}
int main() {
  init();
  process();
  show();
}
