#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;

const int maxn=200010;
ll a[maxn];

int ()
    {
        int n;
        ll f,x;
        scanf("%d",&n);
        for (int i=0;i<n;i++)
            {
                scanf("%lld",&a[i]);
            }
        scanf("%lld%lld",&f,&x);

        ll ans=f+x;
        ll res=0;

        for (int i=0;i<n;i++)
            {
                a[i]-=f;
                res+=a[i]/ans;
                if(a[i]%ans>0)
                    res++;
            }
        res*=x;
        printf("%lldn",res);
        return 0;
    }