#include <bits/stdc++.h>
using namespace std;
int n, m, p1, p2;
long long s1, s2, c[100002], total1, total2, maxn;
int main(){
cin >> n;
for(int i=1; i<=n; i++){
cin >> c[i];
}
cin >> m >> p1 >> s1 >> s2;
c[p1]+=s1;
for(int i=1; i<m; i++){
total1+=c[i]*(m-i);
}
for(int i=m+1; i<=n; i++){
total2+=c[i]*(i-m);
}
maxn=abs(total1-total2);
p2=m;
if(total1>total2){
for(int i=m+1; i<=n; i++){
if(abs(total2+s2*(i-m)-total1)<maxn){
maxn=abs(total2+s2*(i-m)-total1);
p2=i;
}
}
}
else if(total1<total2){
for(int i=1; i<m; i++){
if(abs(total1+s2*(m-i)-total2)<maxn){
maxn=abs(total1+s2*(m-i)-total2);
p2=i;
}
}
}
cout << p2;
return 0;
}