#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(__typeof((X).begin()) it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())

using namespace std;

struct timer{
	time_t start;
	timer(){start=clock();}
	~timer(){cerr<<1.*(clock()-start)/CLOCKS_PER_SEC<<" secs"<<endl;}
};

typedef istringstream iss;
typedef long long ll;
typedef pair<int,int> pi;
typedef stringstream sst;
typedef vector<int> vi;

int K,R,L;
double P,E,T;

double f(int cur,double R,double L){
	if(T-E<=R && L<=T+E)return 1;
	if(L<=T-E || T+E<=R)return 0;
	double H=(R+L)/2;
	if(cur==K)return abs(H-T)<=E;
	if(H>=T)return (1-P)*f(cur+1,R,H) + P*f(cur+1,H,L);
	else return (1-P)*f(cur+1,H,L) + P*f(cur+1,R,H);
}

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	cin>>K>>R>>L>>P>>E>>T;
	cout<<fixed<<setprecision(16)<<f(0,R,L)<<endl;
}