#include <bits/stdc++.h>
using namespace std;
struct node {
  double m[56][56];
} T, P;
node operator*(node A, node B) {
  node C;
  memset(C.m, 0, sizeof(C.m));
  for (int i = 0; i <= 50; i++)
    for (int mid = 0; mid <= 50; mid++)
      for (int j = 0; j <= 50; j++) C.m[i][j] += A.m[i][mid] * B.m[mid][j];
  return C;
}
node KSM(node A, node res, int n) {
  while (n) {
    if (n & 1) res = res * A;
    n >>= 1;
    A = A * A;
  }
  return res;
}
double A[56][56], B[56][56], PA[56][56], PB[56][56], UP, DOWN;
double f[56][56], Out[56];
int main() {
  int n;
  double p, q, s;
  scanf("%d%lf", &n, &p);
  p = p / 1e9;
  q = 1 - p;
  for (int i = 1; i <= 50; i++) A[i][1] = p;
  for (int i = 1; i <= 50; i++)
    A[i][2] = A[i][1] * A[i - 1][1] + q, B[i][2] = q;
  for (int i = 2; i <= 50; i++)
    for (int j = 3; j <= 50; j++) {
      A[i][j] = A[i][j - 1] * A[i - 1][j - 1];
      B[i][j] = B[i][j - 1] * A[i - 1][j - 1];
    }
  for (int i = 1; i <= 50; i++)
    for (int j = 1; j <= 50; j++) {
      PA[i][j] = A[i][j] * (double)(1 - A[i - 1][j]);
      PB[i][j] = B[i][j] * (double)(1 - A[i - 1][j]);
    }
  for (int j = 1; j <= 50; j++) f[1][j] = j;
  for (int i = 2; i <= 50; i++)
    for (int j = 1; j <= 50; j++) {
      UP = DOWN = 0;
      if (j == 1)
        for (int k = 2; k <= 50; k++)
          UP += f[i - 1][k] * PB[i - 1][k], DOWN += PB[i - 1][k];
      else
        for (int k = 1; k < j; k++)
          UP += f[i - 1][k] * PA[i - 1][k], DOWN += PA[i - 1][k];
      f[i][j] = j + UP / DOWN;
    }
  if (n > 50) {
    P.m[0][0] = T.m[0][0] = 1;
    for (int i = 1; i <= 50; i++) T.m[0][i] = f[50][i], P.m[0][i] = i;
    double s = 0;
    for (int k = 2; k <= 50; k++) s += PB[50][k];
    for (int k = 2; k <= 50; k++) P.m[k][1] += PB[50][k] / s;
    for (int j = 2; j <= 50; j++) {
      s = 0;
      for (int k = 1; k < j; k++) s += PA[50][k];
      for (int k = 1; k < j; k++) P.m[k][j] += PA[50][k] / s;
    }
    P = KSM(P, T, n - 50);
    for (int i = 1; i <= 50; i++) Out[i] = P.m[0][i];
  } else
    for (int i = 1; i <= 50; i++) Out[i] = f[n][i];
  double ans = 0;
  for (int j = 1; j <= 50; j++) ans += Out[j] * PA[min(n, 50)][j];
  printf("%.15f\n", ans);
  return 0;
}
