#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll n, m, p1;
ll s1, s2;
ll c[110000];
int main() {
	cin >> n;
	for (ll i = 1; i <= n; i++) cin >> c[i];
	cin >> m>> p1>> s1>> s2;
	ll ans = -1, ansp2 = -1;
	for (ll p2 = 1; p2 <= n; p2++) {
		c[p1] += s1;
		c[p2] += s2;
		ll sum1 = 0, sum2 = 0;
		for (ll i = 1; i <= n; i++) {
			if (i < m) sum1 += c[i] * (m - i);
			else if (i > m) sum2 += c[i] *(i - m);
		}
		ll tmp = abs(sum1 - sum2);
		if (ansp2 == -1 || tmp < ans) {
			ans = tmp;
			ansp2 = p2;
		}
		c[p1] -= s1;
		c[p2] -= s2;
	}
	cout << ansp2;
}