#include <bits/stdc++.h>
using namespace std;
char res[1001][1001];
class CCardiogram {
 public:
  void solve(std::istream& in, std::ostream& out) {
    long long n;
    in >> n;
    long long arr[n];
    for (long long i = 0; i < n; i++) in >> arr[i];
    vector<pair<long long, long long>> pts;
    long long x = 0, y = 0, may = 0, miy = 0, M = 0;
    pts.emplace_back(0, 0);
    for (long long i = 0; i < n; i++) {
      x += arr[i];
      if (i & 1)
        y -= arr[i];
      else
        y += arr[i];
      pts.emplace_back(x, y);
      may = max(may, y);
      miy = min(miy, y);
      M = max(M, x);
    }
    long long N = may - miy;
    for (long long i = 0; i < N; i++)
      for (long long j = 0; j < M; j++) res[i][j] = ' ';
    long long dp[M];
    for (long long i = 0; i < n; i++) {
      long long dir;
      if (pts[i].second < pts[i + 1].second)
        dir = 1;
      else
        dir = -1;
      for (long long j = pts[i].first; j <= pts[i + 1].first - 1; j++)
        dp[j] = dir;
    }
    long long cy = may - 1;
    for (long long cx = 0; cx < M; cx++) {
      if (cx > 0 and dp[cx] != dp[cx - 1]) {
        if (dp[cx] == 1)
          --cy;
        else
          ++cy;
      }
      if (dp[cx] == 1)
        res[cy][cx] = '/', --cy;
      else
        res[cy][cx] = '\\', ++cy;
    }
    for (long long i = 0; i < N; i++) {
      for (long long j = 0; j < M; j++) out << res[i][j];
      out << '\n';
    }
  }
};
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  CCardiogram solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
