import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

void main() {
    immutable int T = 14;
    auto N = readln.chomp.to!int;
    auto P = readln.split.map!(a => a.to!int / 100.0L).array;
    auto trans = new real[int][](1<<T);

    for (int m1 = 0; m1 < (1 << T); ++m1) {
        for(int m2 = m1; m2 >= 0; --m2) {
            m2 &= m1;
            real tmp = 1;
            for (int i = 0; i < T; ++i) {
                if ((1 << i) & m1) {
                    bool l = (i != 0) && ((1 << (i-1)) & m1);
                    bool r = (i != T-1) && ((1 << (i+1)) & m1);
                    real safe;
                    if (l && r)
                        safe = 1 - P[2];
                    else if (l || r)
                        safe = 1 - P[1];
                    else
                        safe = 1 - P[0];
                    tmp *=  ((1 << i) & m2) ? safe : 1 - safe;
                }
            }
            trans[m1][m2] = tmp;
        }
    }

    auto dp = new real[][](80-N+1, 1<<T);
    foreach (i; 0..80-N+1) dp[i].fill(0);
    dp[0][(1<<T)-1] = 1;

    foreach (i; 0..80-N) {
        foreach (m1; 0..(1<<T)) {
            if (dp[i][m1] == 0)
                continue;
            foreach (m2; trans[m1].keys)
                dp[i+1][m2] += dp[i][m1] * trans[m1][m2];
        }
    }

    real ans = 0;
    foreach (mask; 0..(1<<T))
        ans += dp[80-N][mask] * mask.popcnt;
    writefln("%.09f", ans*2);
}