#include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const long long MOD = 1000000007LL;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

// 除算はmodulusと互いに素な数のみ対応
template<long long modulus>
class ModInt{
    long long num;

    long long mod(long long n){
        return (n % modulus + modulus) % modulus;
    }

    long long ext_gcd(long long a, long long b, long long &x, long long &y){
        if(b == 0LL){
            x = 1;
            y = 0;
            return a;
        }

        long long d = ext_gcd(b, a % b, y, x);
        y -= a / b * x;

        return d;
    }

    long long get_inv(long long n){
        long long x, y;
        ext_gcd(n, modulus, x, y);
        return mod(x);
    }

public:
    ModInt(long long n = 0LL){
        init(n);
    }

    void init(long long n = 0LL){
        num = mod(n);
        return;
    }

    long long get(void){
        return num;
    }

    ModInt &operator+=(const ModInt &rhs){
        num += rhs.num;
        if(num >= modulus){
            num -= modulus;
        }
        return *this;
    }

    ModInt &operator-=(const ModInt &rhs){
        num -= rhs.num;
        if(num < 0LL){
            num += modulus;
        }
        return *this;
    }

    ModInt &operator*=(const ModInt &rhs){
        num = num * rhs.num % modulus;
        return *this;
    }

    ModInt &operator/=(const ModInt &rhs){
        long long inv = get_inv(rhs.num);
        num = num * inv % modulus;
        return *this;
    }

    ModInt operator+(const ModInt &rhs) const {
        return ModInt(*this) += rhs;
    }

    ModInt operator-(const ModInt &rhs) const {
        return ModInt(*this) -= rhs;
    }

    ModInt operator*(const ModInt &rhs) const {
        return ModInt(*this) *= rhs;
    }

    ModInt operator/(const ModInt &rhs) const {
        return ModInt(*this) /= rhs;
    }

    ModInt &operator=(const ModInt &rhs){
        num = rhs.num;
        return *this;
    }

    bool operator<(const ModInt &rhs) const {
        return num < rhs.num;
    }
};

template<long long modulus>
ostream &operator<<(ostream &lhs, ModInt<modulus> &rhs){
    lhs << rhs.get();
    return lhs;
}

template<long long modulus>
istream &operator>>(istream &lhs, ModInt<modulus> &rhs){
    long long val;
    lhs >> val;
    rhs.init(val);
    return lhs;
}

using mint = ModInt<MOD>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    mint a, b;
    int c;
    cin >> n >> a >> b >> c;

    vector<mint> fact(n * 2 + 1), ifact(n * 2 + 1), pa(n * 2 + 1), pb(n * 2 + 1), ipab(n * 2 + 1);
    fact[0] = 1;
    pa[0] = 1;
    pb[0] = 1;
    ipab[0] = 1;
    reps(i, n * 2){
        fact[i] = fact[i - 1] * mint(i);
        pa[i] = pa[i - 1] * a;
        pb[i] = pb[i - 1] * b;
        ipab[i] = ipab[i - 1] / (a + b);
    }

    ifact[n * 2] = mint(1) / fact[n * 2];
    rrep(i, n * 2){
        ifact[i] = ifact[i + 1] * mint(i + 1);
    }

    mint ans(0);
    REP(i, n, n * 2){
        mint tmp = fact[i - 1] * ifact[n - 1] * ifact[i - n];
        tmp *= mint(i);
        tmp *= (pa[n] * pb[i - n] + pa[i - n] * pb[n]);
        tmp *= ipab[i];
        ans += tmp;
    }
    ans *= mint(100);
    ans *= ipab[1];

    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 8064