#include using namespace std; #define rep(i,n) for(ll i=0;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,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; 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 inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n;cin >> n;n=80-n; double v[3];rep(i,3)cin >> v[i];rep(i,3)v[i]/=100; vector> dp(n+1,vector(1<<14)); dp[0][(1<<14)-1]=1; rep(i,n){ rep(bit,1<<14){ vector 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<