#include #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--) #define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++) #define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++) #define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++) #define ALL(n) begin(n), end(n) using ll = long long; using namespace std; int main(){ int p, q; cin >> p >> q; double ok = 1, ng = 1e9; while(ng - ok > 0.0000001){ double mid = (ok+ng)/2; double ta = mid*mid; double te = p + q*mid*log2(mid); if(ta < te) ok = mid; else ng = mid; } printf("%.10f\n", ok); return 0; }