#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long

typedef long double LD;

LD log_factorial(int n){
    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);
}

LD log_factorial_2(int n){
    LD l = 0, r = 0;
    for (int i = 1; i <= n; i++) {
        LD l2 = l + logl(i);
        r += logl(i) - (l2 - l);
        l = l2;
    }
    l += r;
    return l;
}

LD log_f(int n){
    if (n >= 1e8) {
        return log_factorial(n);
    } else {
        return log_factorial_2(n);
    }
}

void solve(int R, int B) {
    cout << fixed << setprecision(15);
    // cout << log_factorial(1e8) << ' ' << log_factorial_2(1e8) << endl;
    LD l = 0;
    l += logl(2) * (R + B);
    l -= log_f(R + B);
    l += log_f(R);
    l += log_f(B);

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

void solve_2(long long r, long long b) {
    vector<vector<double>> dp(r+1,vector<double>(b+1));
    for(int i=0;i<=r;i++)
        for(int j=0;j<=b;j++) {
            if(i==0&&j==0) dp[i][j]=1;
            else if(i==0) dp[i][j]=dp[i][j-1]*2;
            else if(j==0) dp[i][j]=dp[i-1][j]*2;
            else {
                // auto [xmin,xmax]=minmax(dp[i][j-1],dp[i-1][j]);
                // double val=(xmax-xmin)/(xmax+xmin+2);
                // dp[i][j]=()
                double a=dp[i-1][j];
                double b=dp[i][j-1];
                dp[i][j]=2*a*b/(a+b);
            }
        }
    if (isnan(dp[r][b]) || dp[r][b] >= 1e9) {
        cout << "Extreme Wealth" << endl;
        return;
    } else {
        cout << dp[r][b] << endl;
    }
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    int R, B; cin >> R >> B;
    if (R > 5000 || B > 5000) {
        solve(R, B);
    } else {
        solve_2(R, B);
    }
}