#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
signed main(){
    double l=1,r=inf*inf;
    double p,q;cin>>p>>q;
    while(r-l>0.0000001){
        double mid=(r+l)/2.0;
        if(p+q*mid*log2(mid)>=mid*mid){
            l=mid;
        }else{
            r=mid;
        }
    }
    cout<<fixed<<setprecision(7)<<l<<endl;
}