#include <bits/stdc++.h>
using namespace std;
double f(int x, double Q, double R, int remain, double p){
	double a = (remain - x) * (Q - (1.0 - p) * R);// もみ消す
	double b = Q * ((1.0 - pow(p, x)) / (1.0 - p)); // クビになる(ゼロ除算に注意)
	return a + b;
}
double g(int x, double Q, double R, int remain, double p){
	double a = -Q + (1 - p) * R;
	double b = Q * pow(p, x);
	return a + b;
}
double h(int t, int N, double X, double Y, double P, double Q, double R){
	int skill = X + t * Y;
	double p = 1.0 - 1.0 / skill;
	int remain = N - t;
	if (skill == 1) { // 必ず卵をかけてしまう場合
		if (remain == 1) {
			return P * t + Q;
		} else {
			return P * t + (Q - R) * (remain - 1) + Q;
		}
	}
	int left = 0, right = remain;
	while (1 < right - left) {
		int mid = (left + right) / 2;
		if (g(mid, Q, R, remain, p) < 0) {
			right = mid;
		} else {
			left = mid;
		}
	}
	return P * t + f(right, Q, R, remain, p);
}
int main(void){
	int N, X, Y;
	cin >> N >> X >> Y;
	double P, Q, R;
	cin >> P >> Q >> R;
	int l = 0, r = N;
    while (r - l > 3) {
        int m1 = l + (r - l) / 3;
        int m2 = r - (r - l) / 3;
        double v1 = h(m1, N, X, Y, P, Q, R);
        double v2 = h(m2, N, X, Y, P, Q, R);
        if (v1 < v2) {
            l = m1;
        } else {
            r = m2;
        }
    }
	double ans = 0;
    for (int t = l; t <= r; ++t) {
        ans = max(ans, h(t, N, X, Y, P, Q, R));
    }
	cout << fixed << setprecision(10) << ans << endl;
}