#include <bits/stdc++.h>
using namespace std;
int v[2001];
map<int, map<int, int> > mat;
int p1, p2;
int ini = 0x3F3F3F3F;
int fim = 0;
void f(int falt, int op) {
  if (falt == 0) {
    if (op == 1)
      p1++;
    else
      p1--;
    ini = min(ini, p1);
    fim = max(fim, p1);
    return;
  }
  ini = min(ini, p1);
  fim = max(fim, p1);
  if (op == 1)
    mat[p1][p2] = 1;
  else
    mat[p1][p2] = 2;
  if (op == 1) {
    p1--;
    p2++;
    f(falt - 1, op);
  } else {
    p1++;
    p2++;
    f(falt - 1, op);
  }
}
int main() {
  int n;
  cin >> n;
  int sum = 0;
  int topo = -1;
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    sum += v[i];
    topo = max(topo, v[i]);
  }
  int maxi = -1;
  for (int i = 0; i < n - 1; ++i) {
    for (int j = i + 1; j < n; ++j) {
      maxi = max(maxi, abs(v[i] - v[j]) + 1);
    }
  }
  for (int i = 0; i < n; ++i) {
    if (i == 0) {
      p1 = (maxi) - (maxi - v[i]);
      p2 = 0;
      f(v[i], !(i & 1));
    } else {
      f(v[i], !(i & 1));
    }
  }
  for (int i = ini; i <= fim; ++i) {
    for (int j = 0; j < p2; ++j) {
      if (mat[i][j] == 0) printf(" ");
      if (mat[i][j] == 1) printf("/");
      if (mat[i][j] == 2) printf("\\");
    }
    printf("\n");
  }
  return 0;
}
