#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace std;


#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll unsigned long long
#define INF (ll)1 << 60
#define MINF (2 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>

long double p, q;
bool solve(long double n) { //条件判定
	if (n * n < p + q * n * (long double)log2(n)) return true; //ここに条件を入れる
	else return false;
}

long double nibutan() { //ちゃろー！

	long double ng = 1e20; //最大値ならs.size()
	long double ok = 1; // 最大値なら0

	REP(i, 10000) {
		long double mid = (ok + ng) / 2;

		if (solve(mid)) ok = mid;
		else ng = mid;
	}
	return ok; //満たさない最大ならng
}
int main() {

	cin >> p >> q;
	cout << fixed << setprecision(10) << nibutan() << endl;
}