#include <bits/stdc++.h>
using namespace std;
int n, a, b, c;
int data[101];
int dp[101][101];
void print() {
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      cout << dp[i][j] / (a + b * j) << ' ';
    }
    cout << endl;
  }
  cout << endl;
}
int main() {
  cin >> n;
  cin >> a >> b >> c;
  for (int i = 1; i <= n; i++) {
    cin >> data[i];
  }
  for (int i = 0; i <= n; i++) {
    dp[i][0] = dp[0][i] = c;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int t1 = (dp[i - 1][j - 1] + data[i]) / (a + b * j);
      int t2 = (dp[i - 1][j] + data[i]) / (a + b * (j + 1));
      if (t1 > t2) {
        dp[i][j] = dp[i - 1][j - 1] + data[i];
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= n; i++) {
    ans = max(ans, dp[n][i] / (a + b * i));
  }
  cout << ans << endl;
  return 0;
}
