#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#define pr pair
#define f first
#define s second
#define ll long long
#define ld long double
#define mp make_pair
#define pll pr<ll,ll>
#define pii pr<int,int>
#define piii pr<int,pii>
using namespace std;
const ld pi=acosl(0.5)*3;
ld cnt(ll x)
{
	if(x%2==1) return cnt(x+1);
	if(x>10000000) return sqrtl(pi*x/2);
	ld fd=x;
	for(int i=1;i<=x/2;i++) fd-=log2l(i+x/2)-log2l(i);
	return powl(2,fd);
}
int main()
{
	ll a,b;
	cin>>a>>b;
	if(a>b) swap(a,b);
	b+=a;
	ld gt=cnt(b);
	ll c=b/2;
	while(gt<9.99e8&&c>a)
	{
		gt=gt*(b-c+1)/c;
		c--;
	}
	if(gt>=9.98e8) cout<<"Extreme Wealth\n";
	else printf("%.10Lf\n",gt);
	return 0;
}