#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 3;
int n, a[N];
int main() {
  scanf("%d", &n);
  int cur = 0, mini = 0, maxi = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    if (i % 2)
      cur -= a[i] - 1;
    else
      cur += a[i] - 1;
    maxi = max(maxi, cur);
    mini = min(mini, cur);
  }
  cur = 0;
  string res[N];
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < a[i]; ++j) {
      for (int k = 0; k <= maxi - mini; ++k) res[k] += ' ';
      if (i % 2)
        res[maxi - cur].back() = '\\';
      else
        res[maxi - cur].back() = '/';
      if (j != a[i] - 1)
        if (i % 2)
          --cur;
        else
          ++cur;
    }
  }
  for (int i = 0; i <= maxi - mini; ++i) printf("%s\n", res[i].c_str());
  return 0;
}
