#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long

typedef long double LD;

LD log_factorial(int n){
    if (n >= 2e7) return (LD) n * logl(n) - (LD) n + logl(n * acosl(-1) * 2) / 2.0L + logl(1.0L + 1.0L / n / 12 + 1.0L / n / n / 288);
    // if (n >= 2e7) return n * logl(n) - n + logl(1.0L / 30 + (LD) n * (1 + 4 * (LD) n * (1 + (LD) n * 2))) / 6.0L + logl(acosl(-1)) / 2;
    else {
        LD l = 0, r = 0;
        for (int i = 1; i <= n; i++) {
            LD l2 = l + logl(i);
            r += (l2 - l) - logl(i);
            l = l2;
        }
        l += r;
        return l;
    }
}

void solve() {
    int R, B; cin >> R >> B;

    LD l = 0;
    l += logl(2) * (R + B);
    l -= log_factorial(R + B);
    l += log_factorial(R);
    l += log_factorial(B);

    if (l > logl(1e9 + 11) || expl(l) > 1e9) {
        cout << "Extreme Wealth" << endl;
    } else {
        cout << fixed << setprecision(10) << expl(l) << endl;
    }
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    // cin >> T;
    while (T--) solve();
}