#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
vector<unordered_map<int,double>> mp(1<<14);
int main(){
    ll n;cin >> n;n=80-n;
    double v[3];rep(i,3)cin >> v[i];rep(i,3)v[i]/=100;
    rep(bit,1<<14){
        vector<int> state(14,2);
        rep(j,14){
            if(j==0){
                state[j]--;if(!(bit&(1<<1)))state[j]--;
            }
            else if(j==13){
                state[j]--;if(!(bit&(1<<12)))state[j]--;
            }
            else {
                if(!(bit&(1<<(j+1))))state[j]--;
                if(!(bit&(1<<(j-1))))state[j]--;
            }
        }
        per(cit,bit+1){
            cit&=bit;
            double to=1;
            rep(j,14){
                if(bit&(1<<j)){
                    if(cit&(1<<j))to*=1.0-v[state[j]];
                    else to*=v[state[j]];
                }
            }
            mp[bit][cit]=to;
        }
    }


    vector<vector<double>> dp(n+1,vector<double>(1<<14));
    dp[0][(1<<14)-1]=1;
    rep(i,n){
        rep(bit,1<<14){
            per(cit,bit+1){
                cit&=bit;
                dp[i+1][cit]+=dp[i][bit]*mp[bit][cit];
            }
        }
    }
    double ans=0;
    rep(i,1<<14){
        ans+=dp[n][i]*__builtin_popcount(i);
    }
    cout << ans*2 <<endl;
}