Problem: Your friend recently gave you some slimes for your birthday. You have a very large amount of slimes with value 1 and 2, and you decide to invent a game using these slimes.

You initialize a row with n empty spaces. You also choose a number p to be used in the game. Then, you will perform the following steps while the last space is empty. 

  1. With probability <image>, you will choose a slime with value 1, and with probability <image>, you will choose a slime with value 2. You place the chosen slime on the last space of the board. 
  2. You will push the slime to the left as far as possible. If it encounters another slime, and they have the same value v, you will merge the slimes together to create a single slime with value v + 1. This continues on until the slime reaches the end of the board, or encounters a slime with a different value than itself. 



You have played the game a few times, but have gotten bored of it. You are now wondering, what is the expected sum of all values of the slimes on the board after you finish the game.

Input

The first line of the input will contain two integers n, p (1 ≤ n ≤ 109, 1 ≤ p < 109).

Output

Print the expected sum of all slimes on the board after the game finishes. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 4.

Namely, let's assume that your answer is a and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

2 500000000


Output

3.562500000000000


Input

10 1


Output

64.999983360007620


Input

100 123456789


Output

269.825611298854770

Note

In the first sample, we have a board with two squares, and there is a 0.5 probability of a 1 appearing and a 0.5 probability of a 2 appearing.

Our final board states can be 1 2 with probability 0.25, 2 1 with probability 0.375, 3 2 with probability 0.1875, 3 1 with probability 0.1875. The expected value is thus (1 + 2)·0.25 + (2 + 1)·0.375 + (3 + 2)·0.1875 + (3 + 1)·0.1875 = 3.5625.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 210;
struct matrix {
  int M;
  long double a[60][60];
  matrix() { memset(a, 0, sizeof(a)); }
  matrix(int M) : M(M) { memset(a, 0, sizeof(a)); }
  matrix operator*(const matrix& ma) const {
    matrix ret(M);
    for (int i = 1; i <= M; ++i)
      for (int k = 1; k <= M; ++k)
        for (int j = 1; j <= M; ++j) ret.a[i][j] += a[i][k] * ma.a[k][j];
    return ret;
  }
  void setM(int m) { M = m; }
  void I() {
    for (int i = 1; i <= M; ++i) a[i][i] = 1;
  }
} A;
long double dp[60][maxn], a[60][maxn], b[60][maxn], p;
long double f[60][maxn], g[60][maxn];
int n;
matrix qpow(matrix A, int n) {
  matrix ret(A.M);
  ret.I();
  for (; n; n >>= 1, A = A * A)
    if (n & 1) ret = ret * A;
  return ret;
}
int main() {
  int na;
  scanf("%d%d", &n, &na);
  p = (long double)na / (long double)1e9;
  int K = 50;
  for (int i = 1; i <= K; ++i) a[1][i] = p;
  a[2][1] = (1 - p);
  for (int i = 2; i <= K; ++i) a[2][i] = (1 - p) + p * p;
  for (int i = 1; i <= K; ++i) b[2][i] = 1 - p;
  for (int i = 3; i <= K; ++i) {
    for (int j = 1; j <= K; ++j)
      a[i][j] = a[i - 1][j] * a[i - 1][j - 1],
      b[i][j] = b[i - 1][j] * a[i - 1][j - 1];
  }
  for (int i = 1; i <= K; ++i) {
    for (int j = 1; j <= K; ++j)
      f[i][j] = a[i][j] * (1 - a[i][j - 1]),
      g[i][j] = b[i][j] * (1 - a[i][j - 1]);
  }
  dp[1][1] = 1, dp[2][1] = 2;
  for (int j = 2; j <= K; ++j) {
    for (int i = 1; i <= K; ++i) {
      if (i == 1) {
        long double all = 0;
        for (int k = 2; k <= K; ++k) all += g[k][j - 1];
        dp[i][j] = i;
        for (int k = 2; k <= K; ++k)
          dp[i][j] += dp[k][j - 1] * g[k][j - 1] / all;
      } else {
        long double all = 0;
        for (int k = 1; k <= i - 1; ++k) all += f[k][j - 1];
        dp[i][j] = i;
        for (int k = 1; k <= i - 1; ++k)
          dp[i][j] += dp[k][j - 1] * f[k][j - 1] / all;
      }
    }
  }
  if (n <= K) {
    long double ans = 0;
    for (int i = 1; i <= K; ++i) ans += dp[i][n] * f[i][n];
    printf("%.15lf", (double)ans);
  } else {
    long double ans = 0;
    A.setM(K + 1);
    for (int i = 1; i <= K; ++i) {
      if (i == 1) {
        long double all = 0;
        for (int k = 2; k <= K; ++k) all += g[k][K];
        A.a[K + 1][i] = i;
        for (int k = 2; k <= K; ++k) A.a[k][i] += g[k][K] / all;
      } else {
        long double all = 0;
        for (int k = 1; k <= i - 1; ++k) all += f[k][K];
        A.a[K + 1][i] = i;
        for (int k = 1; k <= i - 1; ++k) A.a[k][i] += f[k][K] / all;
      }
    }
    A.a[K + 1][K + 1] = 1;
    A = qpow(A, n - K);
    for (int i = 1; i <= K; ++i) {
      long double sum = 0;
      for (int j = 1; j <= K; ++j) sum += dp[j][K] * A.a[j][i];
      sum += A.a[K + 1][i];
      ans += sum * f[i][K];
    }
    printf("%.15lf", (double)ans);
  }
}