Problem: Miki is a high school student. She has a part time job, so she cannot take enough sleep on weekdays. She wants to take good sleep on holidays, but she doesn't know the best length of sleeping time for her. She is now trying to figure that out with the following algorithm:

1. Begin with the numbers K, R and L.
2. She tries to sleep for H=(R+L)/2 hours.
3. If she feels the time is longer than or equal to the optimal length, then update L with H. Otherwise, update R with H.
4. After repeating step 2 and 3 for K nights, she decides her optimal sleeping time to be T' = (R+L)/2.



If her feeling is always correct, the steps described above should give her a very accurate optimal sleeping time. But unfortunately, she makes mistake in step 3 with the probability P.

Assume you know the optimal sleeping time T for Miki. You have to calculate the probability PP that the absolute difference of T' and T is smaller or equal to E. It is guaranteed that the answer remains unaffected by the change of E in 10^{-10}.



Input

The input follows the format shown below

K R L
P
E
T


Where the integers 0 \leq K \leq 30, 0 \leq R \leq L \leq 12 are the parameters for the algorithm described above. The decimal numbers on the following three lines of the input gives the parameters for the estimation. You can assume 0 \leq P \leq 1, 0 \leq E \leq 12, 0 \leq T \leq 12.

Output

Output PP in one line. The output should not contain an error greater than 10^{-5}.

Examples

Input

3 0 2
0.10000000000
0.50000000000
1.00000000000


Output

0.900000


Input

3 0 2
0.10000000000
0.37499999977
1.00000000000


Output

0.810000


Input

3 0 2
0.10000000000
0.00000100000
0.37500000000


Output

0.729000


Input

3 0 2
0.20000000000
0.00000100000
0.37500000000


Output

0.512000

Solution (in CPP):

Solution:
#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll

void solve() {
	int k, r, l;
	cin >> k >> r >> l;
	long double p, e, t;
	cin >> p >> e >> t;
	queue<tuple<int, long double, long double, long double>> nextgo;
	nextgo.push(make_tuple(k, (long double)1.0L, (long double)r, (long double)l));
	long double ans = 0;
	while (nextgo.empty() == false) {
		tuple<int, long double, long double, long double> now = nextgo.front();
		nextgo.pop();
		if (t - e <= get<2>(now) && get<3>(now) <= t + e) {
			ans += get<1>(now);
			continue;
		}
		if (get<2>(now) > t + e || get<3>(now) < t - e) continue;
		get<0>(now)--;
		long double next = (get<2>(now) + get<3>(now)) / 2.0L;
		if (get<0>(now) < 0) {
			if (t - e <= next && next <= t + e) {
				ans += get<1>(now);
			}
			continue;
		}
		if (next < t) {
			//l should be bringed
			nextgo.push(make_tuple(get<0>(now), get<1>(now) * p, get<2>(now), next));

			nextgo.push(make_tuple(get<0>(now), get<1>(now) * (1.0L - p), next ,get<3>(now)));
		}
		else {
			nextgo.push(make_tuple(get<0>(now), get<1>(now) * (1.0L - p), get<2>(now), next));

			nextgo.push(make_tuple(get<0>(now), get<1>(now) * p, next, get<3>(now)));
		}
	}
	cout << ans << endl;
}

#undef int
int main() {
	init();
	solve();
}