#include <bits/stdc++.h>
const int INF = int(1e9);
const long long INF64 = (long long)(INF) * (long long)(INF);
const long double EPS = 1e-9;
const long double PI = (long double)(3.1415926535897932384626433832795);
using std::cin;
using std::cout;
using std::endl;
using std::list;
using std::vector;
using std::rel_ops::operator>;
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> a_rev(n);
  vector<int> a_rev_sums(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    a_rev[i] = i % 2 ? -a[i] : a[i];
  }
  int sum = std::accumulate(a.begin(), a.end(), 0);
  std::partial_sum(a_rev.begin(), a_rev.end(), a_rev_sums.begin());
  int max = *std::max_element(a_rev_sums.begin(), a_rev_sums.end());
  int min = *std::min_element(a_rev_sums.begin(), a_rev_sums.end());
  min = std::min(0, min);
  vector<string> ans(max - min, string(sum, ' '));
  int start_x = 0;
  int start_y = -min;
  char ch = '/';
  int dif = -1;
  for (int i = 0; i < a.size(); ++i) {
    ch = i % 2 ? '\\' : '/';
    dif *= -1;
    for (int j = 0; j < a[i]; ++j) {
      ans[start_y][start_x] = ch;
      start_x++;
      start_y += dif;
    }
    start_y -= dif;
  }
  for (int i = ans.size() - 1; i >= 0; i--) {
    cout << ans[i] << endl;
  }
}
int main() {
  std::chrono::high_resolution_clock::time_point begin =
      std::chrono::high_resolution_clock::now();
  solve();
  std::chrono::high_resolution_clock::time_point end =
      std::chrono::high_resolution_clock::now();
  std::chrono::duration<double> time_span =
      std::chrono::duration_cast<std::chrono::duration<double>>(end - begin);
  std::cerr << endl << "It took me " << time_span.count() << " seconds.";
  return 0;
}
