#include <bits/stdc++.h>
using namespace std;
int main() {
  int g, t, re;
  double a, s, q, z, x, w, wq[103], nn = 1e9;
  scanf("%d %lf %lf", &t, &q, &w);
  for (g = 0; g < t; g++) scanf("%lf", &wq[g]);
  scanf("%lf %lf", &a, &s);
  for (g = 1; g < t; g++) {
    x = wq[g] / q;
    z = (sqrt((a - wq[g]) * (a - wq[g]) + (s * s))) / w;
    if (nn - (z + x) + 1e-5 > 1e-9) {
      nn = z + x;
      re = g;
    }
  }
  printf("%d", re + 1);
  return 0;
}
