#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a[1035];
char s[1035][1035];
void ppt(int x) {
  printf("%d\n", x);
  for (int(i) = 1; (i) <= (int)(n); (i)++) puts(s[i] + 1);
  exit(0);
}
void fmain(int tid) {
  scanf("%d", &n);
  bool fg = 1;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    scanf("%d", &k);
    a[k] = i;
    if (k != i) fg = 0;
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++)
    for (int(j) = 1; (j) <= (int)(n); (j)++) s[i][j] = '.';
  if (fg) ppt(n);
  a[1] = -1;
  for (int(h) = 1; (h) <= (int)(n); (h)++) {
    int l = -1, r = -1;
    for (int(i) = 1; (i) <= (int)(n); (i)++)
      if (a[i] != i) {
        l = i;
        break;
      }
    for (int i = n; i; i--)
      if (a[i] != i) {
        r = i;
        break;
      }
    if (l == r) break;
    if (a[l] == -1) {
      assert(a[r] != -1);
      int t = a[r];
      s[h][l] = s[h][r] = s[h][t] = '/';
      a[l] = a[t];
      a[t] = t;
      a[r] = -1;
    } else {
      assert(a[r] == -1);
      int t = a[l];
      s[h][l] = s[h][r] = s[h][t] = '\\';
      a[r] = a[t];
      a[t] = t;
      a[l] = -1;
    }
  }
  ppt(n - 1);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
