#include <bits/stdc++.h>
using namespace std;
int max_calory = 0;
int N, A, B, C;
vector<int> topping;
void DFS(int item, int calory, int cost) {
  if (item == N) {
    if (max_calory < calory / cost) {
      max_calory = calory / cost;
    }
    return;
  }
  DFS(item + 1, calory, cost);
  DFS(item + 1, calory + topping[item], cost + B);
}
void solve() {
  cin >> N;
  cin >> A >> B;
  cin >> C;
  for (int i = 0; i < N; ++i) {
    int price;
    cin >> price;
    topping.push_back(price);
  }
  DFS(0, C, A);
  cout << max_calory << endl;
}
int main() {
  solve();
  return (0);
}
