Problem: Oleg came to see the maze of mirrors. The maze is a n by n room in which each cell is either empty or contains a mirror connecting opposite corners of this cell. Mirrors in this maze reflect light in a perfect way, which causes the interesting visual effects and contributes to the loss of orientation in the maze.

Oleg is a person of curious nature, so he decided to install n lasers facing internal of the maze on the south wall of the maze. On the north wall of the maze, Oleg installed n receivers, also facing internal of the maze. Let's number lasers and receivers from west to east with distinct integers from 1 to n. Each laser sends a beam of some specific kind and receiver with number a_i should receive the beam sent from laser number i. Since two lasers' beams can't come to the same receiver, these numbers form a permutation — each of the receiver numbers occurs exactly once.

You came to the maze together with Oleg. Help him to place the mirrors in the initially empty maze so that the maximum number of lasers' beams will come to the receivers they should. There are no mirrors outside the maze, so if the laser beam leaves the maze, it will not be able to go back.

Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the size of the maze.

The second line contains a permutation of n integers a_i (1 ≤ a_i ≤ n), where a_i defines the number of the receiver, to which the beam from i-th laser should come.

Output

In the first line print the maximum possible number of laser beams, which can come to the receivers they should.

In the next n lines of length n print the arrangement of mirrors, causing such number of laser beams to come where they should. If the corresponding cell is empty, print ".", otherwise print "/" or "\", depending on the orientation of the mirror.

In your output north should be above, south should be below, and west and east should be on left and on the right respectively.

It is allowed for laser beams to come not to the receivers they correspond to, but they are not counted in the answer.

If there are multiple arrangements of mirrors leading to the optimal answer — print any of them.

Example

Input

4
4 1 3 2


Output

3
...
\..
/../
...\

Note

The picture illustrates the arrangements of the mirrors in the first example.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 1000;
int n;
int target[MAXN];
char g[MAXN][MAXN + 1];
int targetedby[MAXN];
bool done[MAXN];
int solve() {
  for (int x = (0); x < (n); ++x) {
    for (int y = (0); y < (n); ++y) g[x][y] = '.';
    g[x][n] = '\0';
  }
  bool identity = true;
  for (int i = (0); i < (n); ++i)
    if (target[i] != i) identity = false;
  if (identity) return n;
  for (int i = (0); i < (n); ++i) targetedby[target[i]] = i;
  int last = n - 1;
  while (last >= 0 && target[last] == last) --last;
  assert(last >= 0);
  int row = n - 1;
  for (int i = (0); i < (n); ++i) done[i] = target[i] == i;
  {
    int to = targetedby[last];
    done[to] = true;
    while (!done[targetedby[to]]) {
      int from = targetedby[to];
      if (from < to)
        g[row][from] = g[row][to] = '/';
      else if (from > to)
        g[row][from] = g[row][to] = '\\';
      else
        assert(false);
      done[from] = true, to = from, --row;
    }
  }
  for (int i = n - 1; i >= 0; --i)
    if (!done[i]) {
      int to = i;
      while (!done[targetedby[to]]) {
        int from = targetedby[to];
        int realfrom = from != i ? from : last;
        if (realfrom < to)
          g[row][realfrom] = g[row][to] = '/';
        else if (realfrom > to)
          g[row][realfrom] = g[row][to] = '\\';
        else
          assert(false);
        if (to == i) {
          assert(from < to);
          g[row][last] = '/';
        }
        done[from] = true, to = from, --row;
      }
    }
  return n - 1;
}
void run() {
  scanf("%d", &n);
  for (int i = (0); i < (n); ++i) scanf("%d", &target[i]), --target[i];
  printf("%d\n", solve());
  for (int x = (0); x < (n); ++x) printf("%s\n", g[x]);
}
const int DX[] = {-1, 0, +1, 0}, DY[] = {0, -1, 0, +1};
int walk(int x, int y, int k) {
  while (true) {
    x += DX[k], y += DY[k];
    if (x < 0 || x >= n || y < 0 || y >= n) break;
    if (g[x][y] == '\\')
      k ^= 1;
    else if (g[x][y] == '/')
      k = 3 - k;
  }
  return x == -1 ? y : -1;
}
void stress() {
  for (int rep = (0); rep < (10000); ++rep) {
    n = MAXN;
    for (int i = (0); i < (n); ++i) target[i] = i;
    for (int i = (0); i < (n); ++i) {
      int idx = rand() % (i + 1);
      swap(target[i], target[idx]);
    }
    int have = solve();
    int cnt = 0;
    for (int i = (0); i < (n); ++i)
      if (walk(n, i, 0) == target[i]) ++cnt;
    if (have == cnt) {
      printf(".");
      continue;
    }
    printf("err\n");
    for (int i = (0); i < (n); ++i) {
      if (i != 0) printf(" ");
      printf("%d", target[i]);
    }
    puts("");
    printf("have=%d cnt=%d\n", have, cnt);
    for (int x = (0); x < (n); ++x) printf("%s\n", g[x]);
    exit(0);
  }
}
int main() {
  run();
  return 0;
}