#include<iostream>
#include<algorithm>
using namespace std;
struct huyi{
	int flag;
	int sum;
}s[1000000];
bool cmp(huyi x,huyi y)
{
	return x.sum<y.sum;
}
int n;
int a[1000000];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	int m,p1,s1,s2;
	cin>>m>>p1>>s1>>s2;
	int qishi_long=0,qishi_hu=0;
	a[p1]+=s1;
	for(int i=1;i<=n;i++)
	{
		a[i]+=s2;
		for(int j=1;j<m;j++)
		{
			qishi_long+=(m-j)*a[j];
		}
		for(int k=m+1;k<=n;k++)
		{
			qishi_hu+=(k-m)*a[k];
		}
		s[i].sum=abs(qishi_long-qishi_hu);
		s[i].flag=i;
		a[i]-=s2;
	}
	sort(s+1,s+n+n,cmp);
	cout<<s[1].flag;
	return 0;
}