#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
ll n,m;

const db qwq = 56049.9121711435;
const int lim = 1000000000;
db get(ll N){
	if(N <= lim / 10){
		db ret = 1;
		rep(k,1,N) ret = ret * k / (k - 0.5);
		return ret;		
	}
	return qwq * sqrt(1.0 * N / lim); 
}

int main(){
	scanf("%lld%lld",&n,&m);
	if(n < m) swap(n,m);
	ll N,M;
	db res;
	if(n % 2 == m % 2){
		res = get((n + m) / 2);
		N = M = (n + m) / 2;
	}else{
		res = get((n + m) / 2 + 1);
		N = (n + m) / 2 + 1;M = (n + m) / 2;
	}
//	printf("N=%lld M=%lld res=%.10f\n",N,M,res);
	while(n > N){
		res = res / M * (N + 1);
		N++;M--;
		if(res > 1e9){
			printf("Extreme Wealth\n");
			return 0;
		}
	}
	printf("%.10f\n",res);	
	return 0;
}