#include <bits/stdc++.h>
using namespace std;
int n;
int base, top;
int b_cal;
int cal[100];
int dp[100 + 1][100 + 1];
double max_rate;
void solve() {
  for (int i = 0; i < 100 + 1; i++) {
    for (int j = 0; j < 100 + 1; j++) {
      dp[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + cal[i + 1]);
    }
  }
  max_rate = 0;
  for (int i = 0; i <= n; i++) {
    max_rate =
        max(max_rate, (double)(b_cal + dp[n][i]) / (double)(base + top * i));
  }
  return;
}
int main() {
  scanf("%d", &n);
  scanf("%d%d", &base, &top);
  scanf("%d", &b_cal);
  for (int i = 1; i <= n; i++) {
    scanf("%d", cal + i);
  }
  solve();
  printf("%d\n", (int)max_rate);
  return 0;
}
