#include <cstdio>
#include <algorithm>

const int maxN = 100100;
const int inf = 1000000001;
const double eps = 1e-6;

using namespace std;

double A, B, record, powerB[15], finals[maxN];
int N;
int X[maxN], currActions, result, stepsNumber[maxN];

inline void getStepsNumber(double T) {
	int i, j, current;
	double currBPower;

	for (i = 1; i <= N; i++) {
		if ((1 - A) * X[i] < T) {
			stepsNumber[i] = 0;
//			fprintf(stderr, "0 ");
			finals[i] = X[i];
			continue;
		}

		current = 0;
		currBPower = 1;

		for (j = 14; j >= 0; j--) {
			if (X[i] * A * currBPower * powerB[j] * (1 - B) >= T) {
				current += (1 << j);
				currBPower *= powerB[j];
			}
		}

		if (current > 10000)
			current = 10000;
		stepsNumber[i] = current + 2;
		finals[i] = X[i] * A * currBPower * B;

		if (X[i] * A * (1 - B) < T) {
			stepsNumber[i] = 1;
			finals[i] = X[i] * A;
		}

//		fprintf(stderr, "%d ", stepsNumber[i]);
	}
//	fprintf(stderr, "\n");
}

inline bool getSolution() {
	double sumTimes = 0;
	int sumSteps = 0;
	
	for (int i = 1; i <= N; i++) {
		sumTimes += finals[i];
		sumSteps += stepsNumber[i];
	}

	currActions = sumSteps;
	if (sumTimes <= record + eps)
		return true;
	return false;
}

inline void searchSmallestCut(double left, double right) {
	double m;

	while (left + eps <= right) {
		m = (left + right) / 2.0;
//		fprintf(stderr, "%.9lf %.9lf   %.9lf\n", left, right, m);
		getStepsNumber(m);

		if (getSolution()) {
			result = min(result, currActions);
			left = m + eps;
		}
		else
			right = m - eps;
	}
}


int main() {
	int i, j;
	freopen("minim2.in", "r", stdin);
	freopen("minim2.out", "w", stdout);

	scanf("%d", &N);
	for (i = 1; i <= N; i++)
		scanf("%d", &X[i]);

	scanf("%lf%lf%lf", &A, &B, &record);

	powerB[0] = B;
	for (i = 1; i < 15; i++) 
		powerB[i] = powerB[i - 1] * powerB[i - 1];

	result = inf;
	searchSmallestCut(0, 1000000000);

	printf("%d\n", result);

	return 0;
}