#include <bits/stdc++.h>
using namespace std;
int m[3010][1010], arr[1010], h[1010];
int main() {
  int n;
  cin >> n;
  int sum = 0, Max = 0, Min = 0;
  int id = -1;
  for (int i = 1; i <= n; ++i) {
    cin >> arr[i];
    sum += arr[i];
    if (i & 1)
      h[i] = h[i - 1] + arr[i];
    else
      h[i] = h[i - 1] - arr[i];
    if (Max < h[i]) Max = h[i], id = i;
    Min = min(Min, h[i]);
  }
  int hh = Max - Min;
  int s = h[id] - h[0];
  int j = 1;
  for (int i = 1; i <= n; ++i) {
    int tmp;
    if (i & 1)
      tmp = 1;
    else
      tmp = 2;
    ;
    if (tmp == 1) {
      for (int k = 0; k < arr[i]; ++k) m[s--][j++] = tmp;
      ++s;
    } else {
      for (int k = 0; k < arr[i]; ++k) m[s++][j++] = tmp;
      --s;
    }
  }
  for (int i = 1; i <= hh; ++i) {
    for (int j = 1; j <= sum; ++j) {
      if (m[i][j] == 1)
        cout << '/';
      else if (m[i][j] == 2)
        cout << '\\';
      else
        cout << ' ';
    }
    cout << endl;
  }
  return 0;
}
