N,p=input().split()
N=int(N);p=float(p);q=1-p

T=[0]*(N+1)
i=2
for i in range(2,N+1):
    j=2*i
    while j<=N:
        T[j]+=1
        j+=i
    i+=1

C=max(T)
P=[pow(q,i) for i in range(C+1)]
print(sum([P[T[i]] for i in range(2,N+1)]))