#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
void solve()
{
	int P,Q;
	cin >> P >> Q;
	long double ok = 1,ng = 1e18;
	for(int t = 0;t < 200;t++)
	{
		long double mid = (ok+ng)/2;
		if(mid*mid <= P+Q*mid*log2(mid)) ok = mid;
		else ng = mid;
	}

	cout << fixed << setprecision(16) << ok << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}