#include <bits/stdc++.h>
using namespace std;
int n;
double vb, vs;
double x[105];
double tagx, tagy;
double cal(int p) { return sqrt((x[p] - tagx) * (x[p] - tagx) + tagy * tagy); }
int cmp(double x) {
  if (x < (-1e-6))
    return -1;
  else if (x > 1e-6)
    return 1;
  else
    return 0;
}
int main() {
  scanf("%d%lf%lf", &n, &vb, &vs);
  for (int i = 0; i < n; i++) scanf("%lf", &x[i]);
  scanf("%lf%lf", &tagx, &tagy);
  double ans = (double)(0x3f3f3f3f);
  int pos;
  double min_cal;
  for (int i = 1; i < n; i++) {
    double time = (x[i] / vb) + (cal(i) / vs);
    if (cmp(time - ans) == -1) {
      ans = time;
      pos = i;
      min_cal = cal(i);
    } else if (cmp(time - ans) == 0) {
      if (cmp(cal(i) - min_cal) == -1) {
        ans = time;
        pos = i;
        min_cal = cal(i);
      }
    }
  }
  printf("%d\n", pos + 1);
  return 0;
}
