#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;

template<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}
template<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}

#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()

/* do your best */

double lo(double n) {
  return log2(n);
}

int main() {
  
  double p, q; cin >> p >> q;
  double ub = 1e18;
  double lb = 1.0;
  for (int ii = 0; ii < 10000; ii++) {
    double mid = (ub + lb) / 2.0;
    double t1 = mid * mid;
    double t2 = p + q * mid * lo(mid);

    if (t1 <= t2) {
      lb = mid;
    } else {
      ub = mid;
    }
  }

  printf("%.10f\n", lb);
  return 0;
}