#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  priority_queue<int> pq;
  std::vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    pq.push(v[i]);
  }
  int x, first;
  cin >> x >> first;
  long long k = 0;
  while (!pq.empty()) {
    if (pq.top() > x) {
      k += (pq.top() / (x + first));
      if (pq.top() % (x + first) > x) k++;
      pq.pop();
    } else
      break;
  }
  cout << k * (long long)first << endl;
  return 0;
}
