#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100;
int n, a, b, c, ans, cal = 0, cost = 0, tcal[MAX_N + 1], save[MAX_N + 1];
void solve(int roop) {
  if (roop == 0) return;
  for (int i = 1; i <= n; i++) {
    if (save[i] == 1) continue;
    save[i] = 1;
    roop--;
    cost += b;
    cal += tcal[i];
    ans = max(ans, cal / cost);
    solve(roop);
    save[i] = 0;
    cost -= b;
    cal -= tcal[i];
    roop++;
    if (roop == n) save[i] = 1;
  }
}
int main() {
  cin >> n >> a >> b >> c;
  for (int i = 1; i <= n; i++) {
    cin >> tcal[i];
  }
  ans = c / a;
  cost = a;
  cal = c;
  solve(n);
  cout << ans << endl;
}
