N, exe_prob = map(float, input().split())
N = int(N)

def divisor_count(n):
    cnt = 0
    i = 1
    while i*i < n:
        if n % i == 0:
            cnt += 2
        i += 1
    if i*i == n:
        cnt += 1
    return cnt

is_prime = [1] * (N+1)
is_prime[0], is_prime[1] = 0, 0

for i in range(2, N+1):
    is_prime[i] = ((1-exe_prob)**(divisor_count(i)-2))
            
#print(is_prime)
print(sum(is_prime))