#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define INF 1000000000+10

const ll mod = 1000000000+7;
const int N = 300+5;

ld dp[N][N][N];


main()
{
    SPEED;
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int n;
    cin >> n;
    int c1 = 0, c2 = 0, c3  = 0;
    for(int i = 0 ; i<n ;i++)
    {
        int x;
        cin >> x;
        if(x==1)c1++;
        if(x==2)c2++;
        if(x==3)c3++;
    }
    for(int k = 0; k<=n; k++)
    {
        for(int j  = 0; j<=n; j++)
        {
            for(int i = 0; i<=n; i++)
            {
                if(i==0&&j==0&&k==0){
                    dp[i][j][k] = 0;
                    continue;
                }
                if(i>0)dp[i][j][k] += dp[i-1][j][k]*(ld)(i)/(ld)n;
                if(j>0)dp[i][j][k] += dp[i+1][j-1][k]*(ld)(j)/(ld)n;
                if(k>0)dp[i][j][k] += dp[i][j+1][k-1]*(ld)(k)/(ld)n;
                dp[i][j][k] += 1.0;
                dp[i][j][k] *= (ld)n/(ld)(i+j+k);
            }
        }
    }

    cout << fixed << setprecision(10) << dp[c1][c2][c3] <<endl;
}
/*

#include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

using ll = long long;

const int nax = 305;
double p[nax][nax][nax], ev[nax][nax][nax];
// ev[a][b][c] - the expected number of operations so far to get to state (a,b,c)
// easier: p-bility of getting to this state at all

int main() {
    int n;
    scanf("%d", &n);
    vector<int> cnt(4);
    for(int i = 0; i < n; ++i) {
        int x;
        scanf("%d", &x);
        ++cnt[x];
    }
    p[cnt[1]][cnt[2]][cnt[3]] = 1;
    for(int c = n; c >= 0; --c) {
        for(int b = n; b >= 0; --b) {
            for(int a = n; a >= 0; --a) {
                if(a == 0 && b == 0 && c == 0) {
                    continue;
                }
                if(a + b + c > n) {
                    continue;
                }
                // dp[a][b][c]

                double p_waste = (double) (n - (a + b + c)) / n;
                // p_waste + p_waste^2 + ... = S
                // 1 + S = S / p_waste
                double ev_waste = p_waste / (1 - p_waste) + 1;
                debug() << imie(a) imie(b) imie(c) imie(ev_waste);
                ev[a][b][c] += ev_waste * p[a][b][c];

                // remove 1 -> dp[a-1][b][c]
                // we will eventually choose one of a+b+c
                if(a != 0) {
                    double p_go = (double) a / (a + b + c);
                    p[a-1][b][c] += p[a][b][c] * p_go;
                    ev[a-1][b][c] += ev[a][b][c] * p_go;
                }

                // remove 2 -> dp[a+1][b-1][c]
                if(b != 0) {
                    double p_go = (double) b / (a + b + c);
                    p[a+1][b-1][c] += p[a][b][c] * p_go;
                    ev[a+1][b-1][c] += ev[a][b][c] * p_go;
                }

                // remove 3
                if(c != 0) {
                    double p_go = (double) c / (a + b + c);
                    p[a][b+1][c-1] += p[a][b][c] * p_go;
                    ev[a][b+1][c-1] += ev[a][b][c] * p_go;
                }
            }
        }
    }
    printf("%.10lf\n", ev[0][0][0]); // + cnt[1] + 2 * cnt[2] + 3 * cnt[3]);
}
*/
/*
#include <bits/stdc++.h>

using namespace std;

const int MAX = 305;
double p[MAX][MAX][MAX];

int main(int argc, char *argv[])
{
    int N;
    cin >> N;
    vector<int> cnt(4);
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        cnt[a]++;
    }
    p[cnt[1]][cnt[2]][cnt[3]] = 1;
    for(int c = N; c >= 0; --c) {
        for(int b = N; b >= 0; --b) {
            for(int a = N; a >= 0; --a) {
                if (a + b + c == 0) continue;
                if(a + b + c > N) {
                    continue;
                }

                double pa = (double)a / N;
                double pb = (double)b / N;
                double pc = (double)c / N;
                double po = 1 - pa - pb - pc;

                p[a][b][c] += 1 / (1 - po) *
                    (pa * p[a+1][b][c] + pb * (a == 0 ? 0 : p[a-1][b+1][c]) + pc * (b == 0 ? 0 : p[a][b-1][c+1]));
            }
        }
    }
    double res = 0;
    double pp = p[0][0][0];
    cout << pp << endl;
    return 0;
}
*/

Measured memory_bytes: 438528