#include<bits/stdc++.h>
#define ShuaiBi main
using namespace std;
typedef long long ll;
const int N=105,M=7900,mod=1e9+7;
ll Pow(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
        b>>=1;
	}
	return ans;
}
ll Inv(ll x){return Pow(x%mod,mod-2);}
ll p1,p2,p3,p4,psum;
int r,sz,f[M][M],id[N][N],ans[M],n;
void solve(){
	for(int i=1;i<=n;i++){
		ll inv=Inv(f[i][i]);
		for(int j=i;j<=min(n,i+sz);j++) f[i][j]=f[i][j]*inv%mod;
		f[i][n+1]=f[i][n+1]*inv%mod;
		for(int j=i+1;j<=min(n,i+sz);j++) if(f[j][i]){
			inv=f[j][i];
			for(int k=i;k<=min(n,i+sz);k++) f[j][k]=(f[j][k]-f[i][k]*inv%mod+mod)%mod;
			f[j][n+1]=(f[j][n+1]-f[i][n+1]*inv%mod+mod)%mod;
		}
	}
	for(int i=n;i>=1;i--){
		ll sum=f[i][n+1];
		for(int j=i+1;j<=min(n,i+sz);j++) sum=(sum-1ll*f[i][j]*ans[j]%mod+mod)%mod;
		ans[i]=sum;
	}
}
int ShuaiBi(){
	scanf("%d%lld%lld%lld%lld",&r,&p1,&p2,&p3,&p4);
	psum=Inv(p1+p2+p3+p4);
	p1=p1*psum%mod,p2=p2*psum%mod,p3=p3*psum%mod,p4=p4*psum%mod,sz=2*r+1;
	for(int i=1;i<=sz;i++) for(int j=1;j<=sz;j++) if((i-r-1)*(i-r-1)+(j-r-1)*(j-r-1)<=r*r) id[i][j]=++n;
	for(int i=1;i<=sz;i++) for(int j=1;j<=sz;j++)
        if(id[i][j]){
    		f[id[i][j]][id[i][j]]=1;
    		f[id[i][j]][id[i-1][j]]=mod-p1;
    		f[id[i][j]][id[i][j-1]]=mod-p2;
    		f[id[i][j]][id[i+1][j]]=mod-p3;
    		f[id[i][j]][id[i][j+1]]=mod-p4;
    		f[id[i][j]][n+1]=1;
        }
    solve();
    printf("%d\n",ans[id[r+1][r+1]]);
    return 0;
}