#include <bits/stdc++.h>
using namespace std;
double eps = 1e-12;
double dist(int x1, int y1, int x2, int y2) {
  return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));
}
int main() {
  int arr[200], n, vb, vs, x, y;
  cin >> n >> vb >> vs;
  for (int i = 0; i < n; i++) cin >> arr[i];
  cin >> x >> y;
  double min = -1, min_ud = -1;
  int place = 0;
  for (int i = 1; i < n; i++) {
    double univer_dist = dist(arr[i], 0, x, y),
           t = dist(0, 0, arr[i], 0) / vb + univer_dist / vs;
    if (min > t || min == -1 ||
        (min == t && (min_ud == -1 || min_ud - univer_dist > eps))) {
      min = t;
      place = i + 1;
      min_ud = univer_dist;
    }
  }
  cout << place << endl;
}
