#include <bits/stdc++.h>
using namespace std;
void ga(int N, int *A) {
  for (int i(0); i < N; i++) scanf("%d", A + i);
}
long double a = 1e18, b;
int N, U[100005], A, B, c, X, Y;
int main(void) {
  scanf("%d%d%d", &N, &A, &B), ga(N, U), scanf("%d%d", &X, &Y);
  for (int k(1); k < N; k++)
    if (((sqrt(pow(U[k] - X, 2) + pow(0 - Y, 2)) / B) +
         ((U[k] - *U) / (long double)A)) < a ||
        ((((sqrt(pow(U[k] - X, 2) + pow(0 - Y, 2)) / B) +
           ((U[k] - *U) / (long double)A)) +
                  (1e-10) >
              a &&
          ((sqrt(pow(U[k] - X, 2) + pow(0 - Y, 2)) / B) +
           ((U[k] - *U) / (long double)A)) -
                  (1e-10) <
              a) &&
         b > (sqrt(pow(U[k] - X, 2) + pow(0 - Y, 2)) / B)))
      a = ((sqrt(pow(U[k] - X, 2) + pow(0 - Y, 2)) / B) +
           ((U[k] - *U) / (long double)A)),
      b = (sqrt(pow(U[k] - X, 2) + pow(0 - Y, 2)) / B), c = k + 1;
  printf("%d\n", c);
  return 0;
}
