import sys
input = sys.stdin.readline

import math
log2 = math.log2
# from collections import deque

def linput(_t=int):
    return list(map(_t, input().split()))

def gcd(n,m):
    while m: n,m = m, n%m
    return n

def lcm(n,m): return n*m//gcd(n,m)

def main():
    # N = int(input())
    # K = int(input())
    P,Q = linput()

    # vA = linput()
    # vB = linput()
    # S = input().rstrip()
    # mX = [linput() for _ in [0,]*N]
    # res = 0

    L, R = 1.0, 10.0**19
    M = (L+R)/2

    cnt = 0
    LMAX = 10010010
    EPS = 10.0**-8
    while cnt<LMAX and abs(R-L)>EPS:
        if M*M <= P + M*Q*log2(M):
            L = M
        else:
            R = M
        M = (L+R)/2
        cnt += 1

    res = L
    # print(res)
    print("{:.7f}".format(res))

    # print(("No","Yes")[res%2])


main()