#include <bits/stdc++.h>
using namespace std;
const int MOD = int(1e9) + 7;
const int INF = 2147483647;
const int N = 5 * int(1e5) + 3;
int main() {
  int n, res, x[N];
  long double vb, vs, xu, yu;
  cin >> n >> vb >> vs;
  for (int i = 0; i < (n); i++) {
    cin >> x[i];
  }
  cin >> xu >> yu;
  long double ct, gt, ans = 1e10;
  for (int i = (n - 1); i >= (1); i--) {
    ct = 1.0 * x[i] / vb;
    double d = sqrt((x[i] - xu) * (x[i] - xu) + yu * yu);
    gt = d / vs;
    if (ct + gt < ans) {
      ans = ct + gt;
      res = i;
    }
  }
  cout << res + 1;
  cerr << (double)clock() / CLOCKS_PER_SEC << "\n";
}
