#include <bits/stdc++.h>
#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;
  long double ok = 1, ng = 1e18;
  while(ng - ok > (long double)0.0000001 && (ok < ng)){
    long double mid = (ok+ng)/2;
    long double ta = mid*mid;
    long double te = (long double)p + (long double)q*mid*log2(mid);
    if(ta < te) ok = mid;
    else ng = mid;
  }
  cout << fixed << ok << endl;
  return 0;
}