#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
int binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, vb, vs;
  cin >> n >> vb >> vs;
  int ar[n];
  for (int i = 0; i < n; ++i) cin >> ar[i];
  double x, y;
  double mi = LONG_MAX;
  double wts = LONG_MAX;
  long long index;
  cin >> x >> y;
  for (int i = 1; i < n; ++i) {
    double tb = (double)ar[i] / vb;
    double ts = sqrt(((x - ar[i]) * (x - ar[i])) + (y * y)) / (double)vs;
    double t = tb + ts;
    if (t <= mi && ts < wts) {
      mi = t;
      wts = ts;
      index = i;
    }
  }
  cout << index + 1;
  return 0;
}
