#include <bits/stdc++.h>
using namespace std;
const int MXN = 100 + 9;
int n, vb, vs, x[MXN], xu, yu;
int ans;
double Min;
double dist(int xx) {
  return 1.0 * sqrt(1.0 * (xu - xx) * (xu - xx) + yu * yu);
}
void solve() {
  Min = 19260817.0;
  for (int i = n; i >= 2; i--) {
    double d = dist(x[i]);
    double t = d / vs + 1.0 * x[i] / vb;
    if (Min > t) {
      Min = t;
      ans = i;
    }
  }
  printf("%d\n", ans);
}
int main() {
  scanf("%d %d %d", &n, &vb, &vs);
  for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
  scanf("%d %d", &xu, &yu);
  solve();
  return 0;
}
