#include <iostream>
#include <algorithm>
using namespace std;

int N;
double A, B;
double C;
int D[101];

int main() {
  cin >> N;
  cin >> A >> B;
  cin >> C;
  for(int i = 0; i < N; ++i) {
    cin >> D[i];
  }

  int T[101];
  fill(T,T+101,0);
  for(int j = 0; j < N; ++j) {
    for(int i = N; i >= 1; --i) {
      T[i] = max(T[i], T[i-1]+D[j]);
    }
  }
  double maxi = C / A;
  for(int i = 1; i <= N; ++i) {
    maxi = max(maxi, (C+T[i])/(A+i*B));
  }
  cout << (int)maxi << endl;
  return 0;
}