#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N5 = 1e5 + 9;
const long long N6 = 1e6 + 9;
long long pow(long long a, unsigned long long b, long long m) {
  long long ans = 1;
  a = a % m;
  while (b > 0) {
    if (b & 1) {
      ans = (ans * a) % m;
    }
    a = (a * a) % m;
    b = b >> 1;
  }
  return ans;
}
long long modInverse(long long a, long long m) { return pow(a, m - 2, m) % m; }
void init() {}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  long long arr[n];
  for (long long i = 0; i < n; i++) cin >> arr[i];
  long long x, f;
  cin >> x >> f;
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    long long val = ceil((double)(arr[i] + f) / (x + f));
    ans += val - 1;
  }
  cout << ans * f;
  cout << "\n";
  ;
  return 0;
}
