#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, B; cin >> R >> 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;
    }
}

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