#include <iostream>
#include <cmath>
using namespace std;
int c[1000000];
int main()
{
int n, m, s1, p1, s2, p2, dragon = 0, tiger = 0, dragon1, tiger1, min, min1;
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++)
dragon += c[i]*(m-i);
for (int i=n; i>m; i--)
tiger += c[i]*(i-m);
min = abs(dragon-tiger);
for (int i=n; i>=1; i--) {
if (i > m) {
tiger1 = tiger+s2*(i-m);
dragon1 = dragon;
}else if (i < m) {
dragon1 = dragon+s2*(m-i);
tiger1 = tiger;
}else{
dragon1 = dragon;
tiger1 = tiger;
}
min1 = abs(dragon1-tiger1);
if (min1 <= min) {
min = min1;
p2 = i;
}
}
cout << p2 << endl;
return 0;
}