import java.util.*

fun main() {
    val sc = Scanner(System.`in`)
    val n = sc.nextInt()
    val p = sc.nextDouble()

    val dp = Array<Double>(n+1) { 1.0 }
    val isPrime = Array(n+1) { true }
    dp[0] = 0.0; dp[1] = 0.0;

    for (i in 2 .. n) {
        if (!isPrime[i]) continue
        for (j in i*2 .. n step i) dp[j] *= (1 - p)
    }

    val ans = dp.sum()
    println(ans)
}