#include<iostream>
using namespace std;
#define int long long
const int mod = 1000000007;
int invmodd(int x, int modd = mod, int s0 = 1, int s1 = 0){
    return modd?invmodd(modd,x%modd,s1,s0-s1*(x/modd)):s0;
}
inline int invmod(int x){ return (invmodd(x)%mod+mod)%mod; }
int pA[100001]={1}, pB[100001]={1};
signed main(){
    int a, b, c, n;
    cin >> n >> a >> b >> c;
    int X = invmod(a+b), A = a*X%mod, B = b*X%mod, ans = 0, bin = 1;
    for(int i = 0; i < n; i++)pA[i+1] = pA[i]*A%mod, pB[i+1] = pB[i]*B%mod;
    for(int i = 0; i < n; i++){
        if(i) bin = bin*(i+n-1)%mod*invmod(i)%mod;
        ans = (ans + (pA[i] * pB[n] + pA[n] * pB[i])%mod*bin%mod*(n+i))%mod;
    }
    cout << ans*100%mod*X%mod << endl;
}
