Problem: Cold winter evenings in Tomsk are very boring — nobody wants be on the streets at such a time. Residents of Tomsk while away the time sitting in warm apartments, inventing a lot of different games. One of such games is 'Colored Jenga'.

This game requires wooden blocks of three colors: red, green and blue. A tower of n levels is made from them. Each level consists of three wooden blocks. The blocks in each level can be of arbitrary colors, but they are always located close and parallel to each other. An example of such a tower is shown in the figure.

<image>

The game is played by exactly one person. Every minute a player throws a special dice which has six sides. Two sides of the dice are green, two are blue, one is red and one is black. The dice shows each side equiprobably.

If the dice shows red, green or blue, the player must take any block of this color out of the tower at this minute so that the tower doesn't fall. If this is not possible, the player waits until the end of the minute, without touching the tower. He also has to wait until the end of the minute without touching the tower if the dice shows the black side. It is not allowed to take blocks from the top level of the tower (whether it is completed or not).

Once a player got a block out, he must put it on the top of the tower so as to form a new level or finish the upper level consisting of previously placed blocks. The newly constructed levels should have all the same properties as the initial levels. If the upper level is not completed, starting the new level is prohibited.

For the tower not to fall, in each of the levels except for the top, there should be at least one block. Moreover, if at some of these levels there is exactly one block left and this block is not the middle block, the tower falls.

The game ends at the moment when there is no block in the tower that you can take out so that the tower doesn't fall.

Here is a wonderful game invented by the residents of the city of Tomsk. I wonder for how many minutes can the game last if the player acts optimally well? If a player acts optimally well, then at any moment he tries to choose the block he takes out so as to minimize the expected number of the game duration.

Your task is to write a program that determines the expected number of the desired amount of minutes.

Input

The first line of the input contains the only integer n (2 ≤ n ≤ 6) — the number of levels in the tower.

Then n lines follow, describing the levels of the tower from the bottom to the top (the first line is the top of the tower). Each level is described by three characters, the first and the third of them set the border blocks of the level and the second one is the middle block. The character that describes the block has one of the following values 'R' (a red block), 'G' (a green block) and 'B' (a blue block).

Output

In the only line of the output print the sought mathematical expectation value. The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.

Examples

Input

6
RGB
GRG
BBB
GGR
BRG
BRB


Output

17.119213696601992

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
const int maxs = 5000000 + 10;
const double INF = 1e10;
struct Hash {
  int cnt, head[maxs], next[maxs];
  long long state[maxs];
  double ans[maxs];
  double find(long long S) {
    for (int i = head[S % maxs]; i; i = next[i])
      if (state[i] == S) return ans[i];
    return -INF;
  }
  void insert(long long S, double x) {
    if (find(S) == -INF) {
      state[++cnt] = S;
      ans[cnt] = x;
      next[cnt] = head[S % maxs];
      head[S % maxs] = cnt;
    }
  }
} H;
int state[maxn];
bool F(int x) { return !!x; }
int change(char c) { return c == 'R' ? 1 : (c == 'G' ? 2 : 3); }
int getState(int x, int y, int z) {
  if (x > z) swap(x, z);
  return (x << 4) + (y << 2) + z;
}
void invState(int* x, int S) {
  x[0] = (S >> 4) & 3;
  x[1] = (S >> 2) & 3;
  x[2] = S & 3;
}
int tmp[maxn];
long long getHash(int n) {
  long long S = 0;
  for (int i = 1; i <= n; i++) tmp[i] = state[i];
  sort(tmp + 1, tmp + n);
  for (int i = 1; i <= n; i++) S = S * 89 + tmp[i];
  return S;
}
double solve(int n) {
  long long S = getHash(n);
  double ans = H.find(S);
  if (ans != -INF) return ans;
  double res[4];
  res[1] = res[2] = res[3] = INF;
  for (int i = 1; i < n; i++) {
    int Si[3], Sn[3], statei = state[i], staten = state[n], newn = n;
    invState(Si, statei);
    invState(Sn, staten);
    if (F(Si[0]) + F(Si[1]) + F(Si[2]) == 1) continue;
    if (F(Sn[0]) && F(Sn[1]) && F(Sn[2])) {
      newn++;
      memset(Sn, 0, sizeof Sn);
    }
    for (int j = 0; j < 3; j++)
      if (Si[j]) {
        if (F(Si[0]) + F(Si[1]) + F(Si[2]) == 2 && (j == 1 || !Si[1])) continue;
        int t = Si[j];
        Si[j] = 0;
        state[i] = getState(Si[0], Si[1], Si[2]);
        if (F(Si[0]) + F(Si[1]) + F(Si[2]) == 1 || !Si[1]) state[i] = 0;
        Si[j] = t;
        for (int k = 0; k < 3; k++)
          if (!Sn[k]) {
            Sn[k] = t;
            state[newn] = getState(Sn[0], Sn[1], Sn[2]);
            res[t] = min(res[t], solve(newn));
            Sn[k] = 0;
          }
      }
    state[i] = statei;
    state[n] = staten;
  }
  if (res[1] == INF && res[2] == INF && res[3] == INF) {
    H.insert(S, 0.0);
    return 0.0;
  }
  double P = 1.0 / 6.0;
  if (res[1] == INF) {
    P += 1.0 / 6.0;
    res[1] = 0.0;
  }
  if (res[2] == INF) {
    P += 1.0 / 3.0;
    res[2] = 0.0;
  }
  if (res[3] == INF) {
    P += 1.0 / 3.0;
    res[3] = 0.0;
  }
  ans = (1.0 + res[1] / 6.0 + res[2] / 3.0 + res[3] / 3.0) / (1.0 - P);
  H.insert(S, ans);
  return ans;
}
int n, encode[3];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 3; j++) {
      char c;
      cin >> c;
      encode[j] = change(c);
    }
    state[i] = getState(encode[0], encode[1], encode[2]);
  }
  printf("%lf\n", solve(n));
  return 0;
}