#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int k,R,L;
double p,e,t;

double dfs(double l,double r,int d){
	if(d==k){
		if(abs((l+r)/2-t)<e)return 1.0;
		else return 0.0;
	}else if(abs(l-t)<e&&abs(r-t)<e&&t-e<l&&r<t+e){
		return 1.0;
	}else if(r<t-e||t+e<l){
		return 0.0;
	}else{
		double mid=(l+r)/2;
		double res;
		if(t<=mid){
			res=dfs(l,(l+r)/2,d+1)*(1-p)+dfs((l+r)/2,r,d+1)*p;
		}else{
			res=dfs(l,(l+r)/2,d+1)*p+dfs((l+r)/2,r,d+1)*(1-p);
		}
		return res;
	}
}

int main(){
	cin.sync_with_stdio(false);
	cin>>k>>R>>L;
	cin>>p>>e>>t;
	double res=dfs(R,L,0);
	printf("%.10f\n", res);
	return 0;
}