#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define maxn 200010
using namespace std;
int n, fac[maxn], inv[maxn];
int C(int n, int m) {return (ll)fac[n] * inv[m] % mod * inv[n - m] % mod;}
int calc(int a, int k)
{
	int ans = 1;
	while (k)
	{
		if (k % 2) ans = (ll)ans * a % mod;
		a = (ll)a * a % mod;
		k /= 2;
	}
	return ans;
}
int main()
{
	int res = 0, a, b, c, p1, p2;
	cin >> n >> a >> b >> c;
	fac[0] = 1;
	for (int i = 1; i <= 2 * n; i++)
		fac[i] = (ll)fac[i - 1] * i % mod;
	inv[2 * n] = calc(fac[2 * n], mod - 2);
	for (int i = 2 * n - 1; i >= 0; i--)
		inv[i] = inv[i + 1] * ((ll)i + 1) % mod;
	a = (ll)a * calc(100, mod - 2) % mod;
	b = (ll)b * calc(100, mod - 2) % mod;
	p1 = (ll)a * calc((a + b) % mod, mod - 2) % mod;
	p2 = (1 - p1 + mod) % mod;
	for (int i = 0; i <= n - 1; i++)
	{
		int gl = (ll)calc(p2, i) * calc(p1, n) % mod * C(i + n - 1, i) % mod;
		res = (res + gl * ((ll)n + i) % mod) % mod;
	}
	for (int i = 0; i <= n - 1; i++)
	{
		int gl = (ll)calc(p1, i) * calc(p2, n) % mod * C(i + n - 1, i) % mod;
		res = (res + gl * ((ll)n + i) % mod) % mod;
	}
	res = (ll)res * calc((a + b) % mod, mod - 2) % mod;
	cout << res << endl;
	return 0;
}