#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){

    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){

    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){

    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){

    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}


ll fact[800005];
ll rfact[800005];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}


ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r;
ll x[500005],y[500005],z[500005];
ll table[1000010];
char s[500005],t[500005];
//bool used[500005];
bool flag,dame;


int main(){
	cin >> n >> a >> b >> c;
	c3_init();
	ll ans1,ans2;

	ans1 = 0;
	for(i=0;i<n;i++){
		//負けがi回
		ans1 *= a+b;
		ans1 %= mod;
		d = (rui(a,n) * rui(b,i))%mod;
		if(n-1+i >= 1){
			d *= c3(n-1+i,i);
		}
		d %= mod;
		ans1 += (d * (i+n))%mod;
		ans1 %= mod;
	}
	ans1 *= rui(a+b,(n+n-1)*(mod-2));
	ans1 %= mod;

	ans2 = 0;
	for(i=0;i<n;i++){
		//負けがi回
		ans2 *= a+b;
		ans2 %= mod;
		d = (rui(b,n) * rui(a,i))%mod;
		if(n-1+i >= 1){
			d *= c3(n-1+i,i);
		}
		d %= mod;
		ans2 += (d * (i+n))%mod;
		ans2 %= mod;
	}
	ans2 *= rui(a+b,(n+n-1)*(mod-2));
	ans2 %= mod;
	//pe(ans1);
	//pe(ans2);
	//el;
	ans = ans1 + ans2;
	ans %= mod;
	//p(ans);
	ans *= 100;
	ans %= mod;
	ans *= rui(a+b,mod-2);
	ans %= mod;
	p(ans);


	return 0;
}


Measured memory_bytes: 24448