#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}
ll s;
typedef long double ld;
ld h, r, da, dw;
ld get(ld x) {
    return ((dw * x * x + da * (h * h - x * x))) / (dw * x + da * (h - x));
}
void solve() {
    cin >> h >> r >> da >> dw;
    ld L = 0;
    ld R = h;
    for (int iter = 0; iter < 120; iter++) {
        ld f1 = (2 * L + R) / 3;
        ld f2 = (2 * R + L) / 3;
        if (get(f1) > get(f2)) L = f1;
        else R = f2;
    }
    cout << fixed << setprecision(12) << (L + R) / 2 << '\n';
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}