#include <bits/stdc++.h>
using namespace std;
template <int POS, class TUPLE>
void deploy(std::ostream &os, const TUPLE &tuple) {}
template <int POS, class TUPLE, class H, class... Ts>
void deploy(std::ostream &os, const TUPLE &t) {
  os << (POS == 0 ? "" : ", ") << get<POS>(t);
  deploy<POS + 1, TUPLE, Ts...>(os, t);
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &v) {
  int remain = v.size();
  os << "{";
  for (auto e : v) os << e << (--remain == 0 ? "}" : ", ");
  return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::set<T> &v) {
  int remain = v.size();
  os << "{";
  for (auto e : v) os << e << (--remain == 0 ? "}" : ", ");
  return os;
}
template <class T, class K>
std::ostream &operator<<(std::ostream &os, std::map<T, K> &make_pair) {
  int remain = make_pair.size();
  os << "{";
  for (auto e : make_pair)
    os << "(" << e.first << " -> " << e.second << ")"
       << (--remain == 0 ? "}" : ", ");
  return os;
}
int nums[1010];
char ans[2010][2010];
pair<int, int> xy[1010];
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  for (int i = 1; i < (n + 1); i++) {
    cin >> nums[i];
  }
  for (int i = 0; i < (2010); i++) {
    for (int j = 0; j < (2010); j++) {
      ans[i][j] = ' ';
    }
  }
  int x = 1000, y = 1000;
  xy[0] = make_pair(x, y);
  for (int i = 1; i < (n + 1); i++) {
    x += nums[i];
    if (i % 2 == 1) {
      y -= nums[i];
    } else {
      y += nums[i];
    }
    xy[i] = make_pair(x, y);
  }
  x = 1000;
  y = 1000;
  int min_y = 1000;
  int max_y = 1000;
  int max_x = 1000;
  for (int i = 1; i < (n + 1); i++) {
    int next_x = xy[i].first;
    int next_y = xy[i].second;
    min_y = min(min_y, next_y);
    max_y = max(max_y, next_y);
    max_x = next_x;
    char now = '/';
    if (next_y - y >= 0) {
      now = '\\';
    }
    for (int i = min(y, next_y); i < (max(y, next_y)); i++) {
      for (int j = next_x - 1; j >= x; j--) {
        if (now == '/' && i + j == x + max(y, next_y) - 1) {
          ans[i][j] = now;
        } else if (now == '\\' && i - min(y, next_y) == j - x) {
          ans[i][j] = now;
        }
      }
    }
    x = next_x;
    y = next_y;
  }
  for (int i = min_y; i < (max_y); i++) {
    for (int j = 1000; j < (max_x); j++) {
      cout << ans[i][j];
    }
    cout << "\n";
  }
  return 0;
}
