Problem:
Score : 100 points

Problem Statement

There are N dishes, numbered 1, 2, \ldots, N.
Initially, for each i (1 \leq i \leq N), Dish i has a_i (1 \leq a_i \leq 3) pieces of sushi on it.

Taro will perform the following operation repeatedly until all the pieces of sushi are eaten:

Roll a die that shows the numbers 1, 2, \ldots, N with equal probabilities, and let i be the outcome. If there are some pieces of sushi on Dish i, eat one of them; if there is none, do nothing.

Find the expected number of times the operation is performed before all the pieces of sushi are eaten.

Constraints

All values in input are integers.

1 \leq N \leq 300

1 \leq a_i \leq 3

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 \ldots a_N

Output

Print the expected number of times the operation is performed before all the pieces of sushi are eaten.
The output is considered correct when the relative difference is not greater than 10^{-9}.

Sample Input 1

3
1 1 1

Sample Output 1

5.5

The expected number of operations before the first piece of sushi is eaten, is 1.
After that, the expected number of operations before the second sushi is eaten, is 1.5.
After that, the expected number of operations before the third sushi is eaten, is 3.
Thus, the expected total number of operations is 1 + 1.5 + 3 = 5.5.

Sample Input 2

1
3

Sample Output 2

3

Outputs such as 3.00, 3.000000003 and 2.999999997 will also be accepted.

Sample Input 3

2
1 2

Sample Output 3

4.5

Sample Input 4

10
1 3 2 3 3 2 3 2 1 3

Sample Output 4

54.48064457488221

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <cstdio>

const int MaxN = 300 + 5;
const int Mod = 17680321;

int N;
int A[MaxN], Cnt[4];
double dp[MaxN][MaxN][MaxN];
bool vis[MaxN][MaxN][MaxN];

void init() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
  for (int i = 1; i <= N; ++i) Cnt[A[i]]++;
}

double dfs(int k, int i, int j) {
  if (vis[k][i][j] == true) return dp[k][i][j];
  vis[k][i][j] = true;
  if (i == 0 && j == 0 && k == 0) return dp[k][i][j] = 0;

  if (k != 0) dp[k][i][j] += dp[k - 1][i][j + 1] * k / N;
  if (i != 0) dp[k][i][j] += dfs(k, i - 1, j) * i / N;
  if (j != 0) dp[k][i][j] += dfs(k, i + 1, j - 1) * j / N;
  dp[k][i][j]++;
  dp[k][i][j] /= 1.0 * (i + j + k) / N;
  return dp[k][i][j];
}

void solve() {
  for (int k = 0; k <= Cnt[3]; ++k)
    for (int i = 0; i <= N; ++i)
      for (int j = 0; j <= N; ++j)
        dfs(k, i, j);
  printf("%.10lf\n", dp[Cnt[3]][Cnt[1]][Cnt[2]]);
}

int main() {
  init();
  solve();
  return 0;
}