#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int bitcnt(int n){
    int res = 0;
    while(n){
        if(n&1) ++res;
        n>>=1;
    }
    return res;
}

const int N = 14;
vi to[1 << N];
vector<long double> pr[1 << N];
int bs[1 << N];
long double dp[21][1 << N];

int main(){
    int A;
    cin >> A;
    int Y = 80 - A;
    long double P0, P1, P2;
    cin >> P0 >> P1 >> P2;
    P0 *= 0.01;
    P1 *= 0.01;
    P2 *= 0.01;

    rep(S, 1 << N){
        bitset<N> b(S);
        FOR(nS, S, 1 << N)if((S&nS)==S){

            bitset<N> nb(nS);
            long double p = 1;
            rep(i, N){
                if(b[i])continue;
                if(i > 0 && i < N - 1 && b[i-1]&&b[i+1]){
                    if(nb[i])p *= P0;
                    else p *= 1.00 - P0;
                } else if((i > 0 && b[i - 1]) || (i < N - 1 && b[i + 1])){
                    if(nb[i])p *= P1;
                    else p *= 1.00 - P1;
                } else{
                    if(nb[i])p *= P2;
                    else p *= 1.00 - P2;
                }
            }
            to[S].push_back(nS);
            pr[S].push_back(p);
        }
        bs[S] = bitcnt(S);
    }

    dp[0][0] = 1;
    rep(y, Y)rep(S, 1 << N){
        rep(i, sz(to[S])){
            int nS = to[S][i];
            long double p = pr[S][i];
            dp[y + 1][nS] += dp[y][S] * p;
        }
    }

    long double ans = 0;
    rep(SA, 1 << N)rep(SB, 1 << N){
        int cnt = N*2-bs[SA] - bs[SB];
        ans += cnt * dp[Y][SA] * dp[Y][SB];
    }
    cout << setprecision(20) << ans << endl;
}