#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n;
long long  k[N];
int l = 0 , h = 0;
long long  a = 1e9;
int b;
int main ()
{
	scanf("%d",&n);
	for(int i = 1 ; i <= n ; i++)
		scanf("%lld",&k[i]);
	int m , p1 , s1 , s2 ;
	scanf("%d%d%d%d",&m,&p1,&s1,&s2);
	k[p1] += s1;
	for(int i = 1 ; i < m ; i++) l += k[i] * ( m - i);
	for(int i = m + 1 ; i <= n ; i--) h += k[i] * ( i - m );
	for(int i = 1 ; i <= n ; i++)
	{
		int tmp = k[i];
		k[i] += s2;
		for(int i = 1 ; i < m ; i++) l += k[i] * ( m - i);
		for(int i = m + 1 ; i <= n ; i--) h += k[i] * ( i - m );
		if(abs(l-h) < a)
		{
			a = abs(l-h);
			b = i;
		}
		k[i] = tmp;
	}
	cout << b;
	return 0;
}

p5016