#include <bits/stdc++.h>
using namespace std;
vector<long long> a;
long long x, f;
long long findme(long long temp) {
  long long l = 1, r = 1000000000;
  long long ans = 1000000000;
  while (l <= r) {
    long long mid = (l + r) / 2;
    long long tt = (mid * x) + (f * (mid - 1));
    if (tt >= temp) {
      ans = min(ans, mid);
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, d;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> d;
    a.push_back(d);
  }
  cin >> x >> f;
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > x) {
      long long t = findme(a[i]);
      t--;
      ans += t * f;
    }
  }
  cout << ans << endl;
  return 0;
}
