#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
int n;
long long a[500300], d, first;
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  cin >> d >> first;
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans += (a[i] / (d + first)) * first;
    if (a[i] % (d + first) != 0) {
      int rem = a[i] % (d + first);
      if (rem <= d) continue;
      ans += first;
    }
  }
  cout << ans;
  return 0;
}
