#include <bits/stdc++.h>
using namespace std;
int n, i, last, a[1010], ans[1010][1010];
bool used[1010];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 1; i <= n; i++)
    if (a[i] != i) break;
  if (i == n + 1) {
    cout << n << '\n';
    string s = "";
    for (i = 1; i <= n; i++) s += '.';
    for (i = 1; i <= n; i++) cout << s << '\n';
    return 0;
  }
  i = n;
  last = n;
  used[i] = 1;
  while (a[i] != n) {
    if (a[i] > i)
      ans[last][i] = ans[last][a[i]] = 1;
    else
      ans[last][i] = ans[last][a[i]] = 2;
    last--;
    used[i] = used[a[i]] = 1;
    i = a[i];
  }
  for (int k = n, j = last + 1; k >= j; k--, j++) swap(ans[k], ans[j]);
  for (i = 1; i <= n; i++)
    if ((!used[i]) && (a[i] != i)) {
      int j = a[i], cnt = 1;
      used[i] = 1;
      while (j != i) {
        used[j] = 1;
        cnt++;
        j = a[j];
      }
      ans[last][i] = ans[last][a[i]] = ans[last][n] = 1;
      ans[last - cnt + 1][a[a[i]]] = ans[last - cnt + 1][n] = 2;
      int newlast = last - cnt;
      j = a[a[i]];
      cnt = 1;
      while (j != i) {
        if (a[j] > j)
          ans[last - cnt][j] = ans[last - cnt][a[j]] = 1;
        else
          ans[last - cnt][j] = ans[last - cnt][a[j]] = 2;
        j = a[j];
        cnt++;
      }
      for (int k = last - 1, p = newlast + 2; k > p; k--, p++)
        swap(ans[k], ans[p]);
      last = newlast;
    }
  cout << n - 1 << '\n';
  for (i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++)
      if (ans[i][j] == 1)
        cout << '/';
      else if (ans[i][j] == 2)
        cout << '\\';
      else
        cout << '.';
    cout << '\n';
  }
  return 0;
}
