//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;

#define fi first
#define se second
#define mp make_pair
 
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1ll << 60;
const double PI = 2 * asin(1);

void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

ld P, Q;

bool Calc(ld X){
  ld ans = X * X - Q * X * log2(X) - P;
  if (ans <= 0) return true;
  else return false;
}

int main(){
  cin >> P >> Q;

  ld L = sqrt(P), R = 1e16;
  while (R - L > 1e-8){
    ld Mid = (L + R) / 2;
    if (Calc(Mid)) L = Mid;
    else R = Mid;
  }

  cout << setprecision(32) << L << endl;
  return 0;
}