#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

#define maxn 100010

long n, i, j, k, sol;
vector<double> sa, sb;
double a, b, r, sum;

int main()
{
    freopen("minim2.in", "r", stdin);
    freopen("minim2.out", "w", stdout);
    scanf("%d", &n);
    for(i=1; i<=n; i++)
    {
        scanf("%d", &k);
        sum=sum+k;
        sa.push_back((double)k);
    }
    scanf("%lf%lf%lf", &a, &b, &r);
    make_heap(sa.begin(), sa.end());
    while(sum-0.000001>r)
    {
        if(sb.size()==0 || (sa.size()>0 && sa[0]*(1-a)>sb[0]*(1-b)))
        {
            sum-=sa[0]*(1-a);
            sb.push_back(sa[0]*a);
            push_heap(sb.begin(), sb.end());
            pop_heap(sa.begin(), sa.end());
            sa.pop_back();
        }
        else
        {
            sum-=sb[0]*(1-b);
            sb.push_back(sb[0]*b);
            push_heap(sb.begin(), sb.end());
            pop_heap(sb.begin(), sb.end());
            sb.pop_back();
        }
        sol++;
    }
    printf("%d\n", sol);
    return 0;
}