#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <limits.h>
#include <time.h>
#include <string>
#include <string.h>
#include <sstream>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>

using namespace std;

typedef long long ll;

int main(){
  int n;
  double p;
  cin >> n >> p;
  vector<double> list(n+1, 1.0);

  list[0] = 0.0;
  list[1] = 0.0;

  for(int i = 2; i <= n; i++){
    for(int j = 2*i; j <= n; j += i){
      list[j] *= (1.0 - p);
    }
  }

  double answer = 0.0;

  for(int i = 0; i <= n; i++){
    answer += list[i];
  }

  printf("%10.6f\n", answer);

  return 0;
}