#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
int n;
int a[1011];
char s[1011][1011];
int rn, cid;
bool vis[1011];
void dfs(int x, int lv = 0) {
  vis[x] = 1;
  if (!vis[a[x]]) {
    dfs(a[x], lv + 1);
    if (a[x] < x)
      s[rn][x] = s[rn][a[x]] = '\\';
    else
      s[rn][x] = s[rn][a[x]] = '/';
    rn--;
  } else if (cid != -1) {
    assert(x > a[x]);
    s[rn][x] = s[rn][1] = '\\';
    s[rn - lv][1] = '/';
    rn--;
  }
}
int main() {
  n = getnum();
  for (int i = 1; i <= n; i++) a[i] = getnum();
  bool flag = 1;
  for (int i = 1; i <= n; i++) flag &= a[i] == i;
  if (flag) {
    putnum(n), putchar('\n');
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        putchar('.');
      }
      puts("");
    }
  } else {
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++) s[i][j] = '.';
    rn = n;
    if (a[1] != 1) {
      cid = -1;
      dfs(1);
    }
    cid = 1;
    for (int i = 1; i <= n; i++) {
      if (!vis[i] && a[i] > i) {
        dfs(i);
      }
    }
    putnum(n - 1), putchar('\n');
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        putchar(s[i][j]);
      }
      puts("");
    }
  }
  return 0;
}
