Problem: In the year 2020, a race of atomically energized cars will be held. Unlike today’s car races, fueling is not a concern of racing teams. Cars can run throughout the course without any refueling. Instead, the critical factor is tire (tyre). Teams should carefully plan where to change tires of their cars.

The race is a road race having n checkpoints in the course. Their distances from the start are a1, a2, ... , and an (in kilometers). The n-th checkpoint is the goal. At the i-th checkpoint (i < n), tires of a car can be changed. Of course, a team can choose whether to change or not to change tires at each checkpoint. It takes b seconds to change tires (including overhead for braking and accelerating). There is no time loss at a checkpoint if a team chooses not to change tires.

A car cannot run fast for a while after a tire change, because the temperature of tires is lower than the designed optimum. After running long without any tire changes, on the other hand, a car cannot run fast because worn tires cannot grip the road surface well. The time to run an interval of one kilometer from x to x + 1 is given by the following expression (in seconds). Here x is a nonnegative integer denoting the distance (in kilometers) from the latest checkpoint where tires are changed (or the start). r, v, e and f are given constants.


1/(v - e × (x - r)) (if x ≥ r)
1/(v - f × (r - x)) (if x < r)


Your mission is to write a program to determine the best strategy of tire changes which minimizes the total time to the goal.



Input

The input consists of multiple datasets each corresponding to a race situation. The format of a dataset is as follows.


n
a1 a2 . . . an
b
r v e f


The meaning of each of the input items is given in the problem statement. If an input line contains two or more input items, they are separated by a space.

n is a positive integer not exceeding 100. Each of a1, a2, ... , and an is a positive integer satisfying 0 < a1 < a2 < . . . < an ≤ 10000. b is a positive decimal fraction not exceeding 100.0. r is a nonnegative integer satisfying 0 ≤ r ≤ an - 1. Each of v, e and f is a positive decimal fraction. You can assume that v - e × (an - 1 - r) ≥ 0.01 and v - f × r ≥ 0.01.

The end of the input is indicated by a line with a single zero.

Output

For each dataset in the input, one line containing a decimal fraction should be output. The decimal fraction should give the elapsed time at the goal (in seconds) when the best strategy is taken. An output line should not contain extra characters such as spaces.

The answer should not have an error greater than 0.001. You may output any number of digits after the decimal point, provided that the above accuracy condition is satisfied.

Example

Input

2
2 3
1.0
1 1.0 0.1 0.3
5
5 10 15 20 25
0.15
1 1.0 0.04 0.5
10
1783 3640 3991 4623 5465 5481 6369 6533 6865 8425
4.172
72 59.4705 0.0052834 0.0611224
0


Output

3.5397
31.9249
168.6682

Solution (in CPP):

Solution:
#include<cstdio>
#include<algorithm>

#define	rep(i,n)	for(int i=0;i<n;i++)

using namespace std;

int main(){
	for(int n;scanf("%d",&n),n;){
		int a[101]={},r;
		rep(i,n)	scanf("%d",a+i+1);
		double b,v,e,f;	scanf("%lf%d%lf%lf%lf",&b,&r,&v,&e,&f);
		n++;

		static double t[10001];
		rep(x,a[n-1]){
			if(x<r)	t[x+1]=t[x]+1/(v-f*(r-x));
			else	t[x+1]=t[x]+1/(v-e*(x-r));
		}

		static double dp[101][10001];
		rep(i,n)rep(x,a[n-1]+1)	dp[i][x]=1e60;
		dp[0][0]=0;
		for(int i=1;i<n;i++){
			int dis=a[i]-a[i-1];
			for(int x=dis;x<=a[n-1];x++){
				dp[i][x]=min(dp[i][x],dp[i-1][x-dis]+t[x]-t[x-dis]);
				dp[i][0]=min(dp[i][0],dp[i][x]+b);
			}
		}

		printf("%.9f\n",*min_element(dp[n-1],dp[n-1]+a[n-1]+1));
	}

	return 0;
}