#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <class C>
void mini(C &a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
  a4 = max(a4, b4);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << '=' << h << ',';
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
const long long MAX = 1001;
long long n;
long long gd[MAX];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  if (0) cout << fixed << setprecision(6);
  cin >> n;
  bool wynn = 1;
  for (long long i = (0); i <= ((long long)(n)-1); i++) {
    long long pom;
    cin >> pom;
    pom--;
    gd[pom] = i;
    if (pom != i) wynn = 0;
  }
  if (wynn) {
    cout << n << "\n";
    string res(n, '.');
    for (long long i = (0); i <= ((long long)(n)-1); i++) {
      cout << res << "\n";
    }
    return 0;
  }
  cout << n - 1 << "\n";
  long long wol = 0;
  for (long long _ = (0); _ <= ((long long)(n)-1); _++) {
    string res(n, '.');
    if (gd[wol] != wol) {
      long long ak = -1;
      for (long long j = (0); j <= ((long long)(n)-1); j++) {
        if (gd[j] == wol) {
          ak = j;
          break;
        }
      }
      if (ak < wol) {
        res[ak] = '\\';
        res[wol] = '\\';
        if (gd[wol] == ak) {
          for (long long i = 0; i < ak; i++) {
            if (gd[i] != i) {
              res[i] = '\\';
              swap(gd[i], gd[ak]);
              ak = i;
              break;
            }
          }
        }
      } else {
        res[ak] = '/';
        res[wol] = '/';
        for (long long i = n - 1; i > ak; i--) {
          if (gd[i] != i) {
            res[i] = '/';
            swap(gd[i], gd[ak]);
            ak = i;
            break;
          }
        }
      }
      swap(gd[ak], gd[wol]);
      wol = ak;
    } else {
      for (long long j = (0); j <= ((long long)(n)-1); j++) {
        if (gd[j] < j && wol < gd[j]) {
          long long a = wol;
          long long b = gd[j];
          long long c = j;
          res[a] = '/';
          res[b] = '/';
          res[c] = '/';
          gd[a] = gd[b];
          gd[b] = b;
          gd[c] = a;
          wol = c;
          break;
        }
        if (gd[j] > j && wol > gd[j]) {
          long long a = wol;
          long long b = gd[j];
          long long c = j;
          res[a] = '\\';
          res[b] = '\\';
          res[c] = '\\';
          gd[a] = gd[b];
          gd[b] = b;
          gd[c] = a;
          wol = c;
          break;
        }
      }
    }
    cout << res << "\n";
  }
}
