#include <bits/stdc++.h>
int main(void) {
  double a[101], t[101];
  int n, i, biaoji;
  double vb, vs;
  double x, y, min, minn, k;
  while (scanf("%d%lf%lf", &n, &vb, &vs) != EOF) {
    for (i = 1; i <= n; i++) scanf("%lf", &a[i]);
    scanf("%lf%lf", &x, &y);
    for (i = 1; i <= n; i++) t[i] = 0;
    for (i = 2; i <= n; i++) {
      t[i] += a[i] / vb;
      t[i] += sqrt(y * y + (x - a[i]) * (x - a[i])) / vs;
    }
    for (i = 2, min = 99999999; i <= n; i++)
      if (t[i] < min) min = t[i];
    for (i = 2, minn = 99999999; i <= n; i++)
      if (fabs(min - t[i]) < 1e-6) {
        k = sqrt(y * y + (x - a[i]) * (x - a[i]));
        if (k + 1e-6 < minn) minn = k, biaoji = i;
      }
    printf("%d\n", biaoji);
  }
  return 0;
}
