//
//  main.cpp
//

#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

using ll = long long;
using ull = unsigned long long;

namespace Util {
template<typename INT>
INT gcd_with_coef(INT x, INT y, INT* outCX, INT* outCY);
};

template<typename INT>
INT Util::gcd_with_coef(INT x, INT y, INT* outCX, INT* outCY) {
	if (x < 0) {
		INT d = gcd_with_coef(-x, y, outCX, outCY);
		*outCX *= -1;
		return d;
	}
	if (y < 0) {
		INT d = gcd_with_coef(x, -y, outCX, outCY);
		*outCY *= -1;
		return d;
	}
	if (x > y) {
		return gcd_with_coef(y, x, outCY, outCX);
	}
	if (x == 0) {
		if (outCX != nullptr && outCY != nullptr) {
			*outCX = 0;
			*outCY = 1;
		}
		return y;
	}
	INT q = y / x;
	INT r = y % x;
	INT d = gcd_with_coef(r, x, outCY, outCX);
	if (outCX != nullptr && outCY != nullptr) {
		*outCX -= q * *outCY;
	}
	return d;
}

struct Mod {
	static ll BASE;
	ll value = 0;
	static ll residue(ll value) { return (value % BASE + BASE) % BASE; }
	Mod(ll value)
	: value(residue(value)) {}
	Mod operator+(const Mod& rhs) const { return Mod(value + rhs.value); }
	void operator+=(const Mod& rhs) { *this = *this + rhs; }
	Mod operator-(const Mod& rhs) const { return Mod(value - rhs.value); }
	void operator-=(const Mod& rhs) { *this = *this - rhs; }
	Mod operator*(const Mod& rhs) const { return Mod(value * rhs.value); }
	void operator*=(const Mod& rhs) { *this = *this * rhs; }
	Mod operator/(const Mod& rhs) const { return *this * rhs.inv(); }
	void operator/=(const Mod& rhs) { *this = *this / rhs; }
	Mod inv() const {
		if (value == 0) {
			assert(false);
			throw "[Mod::inv] div by zero";
		}
		ll ans, sub;
		ll d = Util::gcd_with_coef<ll>(value, BASE, &ans, &sub);
		if (d != 1) {
			assert(false);
			throw "[Mod::inv] not invertible";
		}
		return ans;
	}
	static vector<vector<Mod>> binom_table(ll n) {
		vector<vector<Mod>> ans;
		auto get = [&ans](ll r, ll k) -> Mod {
			if (r < 0 || k < 0 || k > r) {
				return Mod(0);
			} else {
				return ans[r][k];
			}
		};
		ans.push_back({Mod(1)});
		for (ll r = 1; r <= n; r++) {
			ans.push_back(vector<Mod>());
			for (ll k = 0; k <= r; k++) {
				ans[r].push_back(get(r - 1, k) + get(r - 1, k - 1));
			}
		}
		return ans;
	}
	static Mod power(Mod base, ll n) {
		assert(n >= 0);
		Mod ans(1);
		Mod pow(base);
		for (int i = 0; i < 63; i++) {
			if ((n >> i) & 1) {
				ans *= pow;
			}
			pow = pow * pow;
		}
		return ans;
	}
};
ll Mod::BASE = 1000000007;

int main() {
	ll N, A, B, C;
	cin >> N >> A >> B >> C;
	Mod n_fact = 1;
	for (ll i = 1; i <= N; i++) {
		n_fact *= i;
	}
	vector<Mod> n_perm(N + 1, (Mod)0);
	for (ll m = 0; m <= N; m++) {
		if (m == 0) {
			n_perm[0] = (Mod)1;
		} else {
			n_perm[m] = n_perm[m - 1] * (Mod)(N - m + 1);
		}
	}
	Mod denom = Mod::power(Mod(A) + Mod(B), 2 * N) * n_fact * n_fact;
	Mod numer = 0;
	Mod m_plus_n_fact = n_fact;
	Mod m_fact = 1;
	for (ll m = 0; m < N; m++) {
		if (m > 0) {
			m_fact *= (Mod)m;
			m_plus_n_fact *= ((Mod)N + (Mod)m);
		}
		numer += n_perm[N - m] * m_plus_n_fact
			* (Mod::power(A, N) * Mod::power(B, m)
			   + Mod::power(B, N) * Mod::power(A, m))
			* Mod::power(A + B, N - m - 1);
	}
	numer *= (Mod)100 * (Mod)N;
	Mod ans = numer / denom;
	cout << ans.value << endl;
}


Measured memory_bytes: 1152