#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)

void slove(){
   int n;
   double p;
   cin >> n >> p;
   if (n >= 200) {
     cout << 1.0000000 << endl;
     return;
   }
   else{
     double ans = 1.0;
     double tmp = 1.0;
     for (int i = 0; i < n;i++){
       tmp *= (1-p);
     }
     printf("%.8f\n",ans-tmp);
   }
   
}
int main(){
  int tt = 1;
  //cin >> tt;
  while(tt--){
   slove();
  }
  return 0;
}