#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
int main(){
	long long a[100005],n,m,p1,p2,s1,s2;
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	cin >> m >> p1 >> s1 >> s2;
	a[p1]+=s1;
	p2=m;
	long long sum1=0,sum2=0;
	for(int i = 0; i < n; i++){
		if(i<m) sum1+=a[i]*(m-i);
		if(i>m) sum2+=a[i]*(i-m);
	}
	long long diff = labs(sum1-sum2);
	for(int i = 0; i < n; i++){
		if(i<m){
			sum1+=s2*(m-i);
			int d = labs(sum1-sum2);
			if(d<diff) p2 = i;
			sum1-=s2*(m-i);
		} else if(i > m){
			sum2+=s2*(i-m);
			int d = labs(sum1-sum2);
			if(d<diff) p2 = i;
			sum2-=s2*(i-m);
		}
	}
	cout << p2;
	return 0;
}