#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <math.h>
using namespace std;

typedef long long ll;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll p,q; cin >> p >> q;
    double left=1.0,right=1e15;
    for(int i=0;i<300;i++){
        double mid=(left+right)/2.0;
        if(mid*mid<=1.0*p+(double)q*mid*log2(mid)){
            left=mid;
        }
        else{
            right=mid;
        }
    }
    printf("%.12f\n",left);
}