#include <bits/stdc++.h>
using namespace std;
long long N, A, B, C, D[101], dp[101], ans;
void dfs(long long num, long long dol, long long cal) {
  if (num == N + 1) return;
  ans = max(ans, cal / dol);
  dfs(num + 1, dol + B, cal + D[num]);
  dfs(num + 1, dol, cal);
}
signed main() {
  cin >> N >> A >> B >> C;
  for (long long i = 0; i < N; i++) {
    cin >> D[i];
  }
  dfs(0, A, C);
  cout << ans << endl;
  return 0;
}
