#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long c[100000] , m , p1 , p2 , s1 , s2 , l , h;
int main()
{
    long long n  , minn , min = 9999999;
    cin >> n;
    for(int i = 1; i <= n; ++i) {
    	cin >> c[i];
    }
    cin >> m >> p1 >> s1 >> s2;
    for(int i = 1; i < m; ++i) {
    	l += c[i] * (m - i);
    	if(i == p1) {
    		l += (m - i) * s1;
    	}
    }
    for(int i = m + 1; i <= n; ++i) {
    	h += c[i] * (i - m);
    	if(i == p1) {
    		h += (i - m) * s1;
    	}
    }
    if(l > h) {
    	for(int i = m + 1; i <= n; ++i) {
    		if(abs(h + s2 * (i - m) - l)  < min) {
    			min = abs(h + s2 * (i - m)) - l;
    			minn = i;
    		}
    	}
    } else {
    	for(int i = 1; i < m; ++i) {
    		if(abs(l + s2 * (m - i) - h) < min) {
    			min = abs(l + s2 * (m - i)) - h;
    			minn = i;
    		}
    	}
    }
    cout << minn;
    return 0;
}