#include <bits/stdc++.h>
using namespace std;
char arr[2005][2005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, tk, sum = 0, mx = 0, top = 0, best = 0, low = 0;
  cin >> n;
  vector<int> vc;
  for (int i = 1; i <= n; i++) {
    cin >> tk, vc.push_back(tk);
    sum += tk;
    mx = max(mx, tk);
    if (i % 2)
      top += tk, best = max(best, top);
    else
      top -= tk;
  }
  int x = (best - vc[0]) + vc[0], y = 0;
  int cnt = 0;
  x--;
  top = 10000;
  low = 0;
  top = min(top, vc[0]);
  int ed[2005];
  memset(ed, -1, 2005);
  for (int i = 1; i <= n; i++) {
    ;
    cnt = 0;
    if (i % 2 == 0)
      top = min(top, x);
    else
      low = max(low, x);
    if (i % 2) {
      for (; cnt < vc[i - 1]; x--, y++, cnt++) {
        arr[x][y] = '/';
        ed[x]++;
      }
      x++;
    } else {
      int f = y;
      {
        for (; cnt < vc[i - 1]; x++, y++, cnt++) {
          arr[x][y] = '\\';
          ed[x]++;
        }
      }
      x--;
    }
  }
  for (int i = 0; i < 2005; i++) {
    if (ed[i] == -1) continue;
    for (int j = 0; j < sum; j++) {
      if (arr[i][j] != '\\' && arr[i][j] != '/')
        cout << " ";
      else
        cout << arr[i][j];
    }
    cout << "\n";
  }
}
