#include <bits/stdc++.h>
using namespace std;
int n, x, f, a[200009];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  scanf("%d%d", &x, &f);
  long long res = 0;
  for (int i = 1; i <= n; i++)
    res += 1LL * f * ((a[i] / (x + f)) + (a[i] % (x + f) > x ? 1LL : 0));
  printf("%lld", res);
  return 0;
}
