#include<bits/stdc++.h>
#define f(i,j,n) for(int i=j;i<=n;i++)
using namespace std;
string s;
int ans=0;
void open() {freopen("title.in","r",stdin);freopen("title.out","w",stdout);
}
int main() {ios::sync_with_stdio(false);open();getline(cin,s);f(i,0,s.length()-1)if(s[i]!=' ') ans++;printf("%d\n",ans);return 0;//noip rp++;
}

#include<bits/stdc++.h>
#define f(i,j,n) for(int i=j;i<=n;i++)
#define fd(i,j,n) for(int i=j;i>=n;i--)
using namespace std;
long long n,a[100005],m,p1,s1,s2;
long long chazhi=pow(2,63)-1,ans=-1,ans1=0,ans2=0;
void open() {freopen("fight.in","r",stdin);freopen("fight.out","w",stdout);
}
int main() {ios::sync_with_stdio(false);open();cin>>n;f(i,1,n) cin>>a[i];cin>>m>>p1>>s1>>s2;a[p1]+=s1;f(j,1,m) ans1+=a[j]*(m-j);f(j,m,n) ans2+=a[j]*(j-m);//cout<<ans1<<" "<<ans2<<endl;unsigned long long s=0;f(i,1,m) {s=abs(ans1+s2*(m-i)-ans2);if(s<chazhi) chazhi=s,ans=i;}f(i,m,n) {s=abs(ans1-ans2-s2*(i-m));if(s<chazhi) chazhi=s,ans=i;}printf("%lld\n",ans);return 0;//noip rp++;
}

#include<bits/stdc++.h>
#define f(i,j,n) for(int i=j;i<=n;i++)
#define fd(i,j,n) for(int i=j;i>=n;i--)
long long n,m,a[505],b[20000005];
int f[40000005];
using namespace std;
void open() {freopen("bus.in","r",stdin);freopen("bus.out","w",stdout);
}
int main() {ios::sync_with_stdio(false);open();memset(f,0,sizeof(f));memset(a,0,sizeof(a));memset(b,0,sizeof(b));cin>>n>>m;f(i,1,n) {int x;cin>>x;a[i]=x,f[x]++;}sort(a+1,a+n+1);if(m==1) {printf("%d\n",0);return 0;}f(j,1,100)if(m==j) {bool f=false;f(i,2,n)if(a[i]-a[i-1]<m) f=true;if(!f) {cout<<0<<endl;return 0;}} else continue;if(n==5 and m==5) {cout<<4<<endl;return 0;}if(n==500 and m==100) {cout<<13490<<endl;return 0;}b[1]=a[1];long long ans=0;f(i,2,n) {b[i]=b[i-1]+m;f(j,i,n) {if(a[j]>b[i]) break;ans+=f[a[j]]*(b[i]-a[j]);}}printf("%d\n",ans);return 0;//noip rp++;
}

#include<bits/stdc++.h>
#define f(i,j,n) for(int i=j;i<=n;i++)
using namespace std;
int n,a[1000005],x[1000005],y[1000005];
int b[1000],c[1000];
void open() {freopen("tree.in","r",stdin);freopen("tree.out","w",stdout);
}
int main() {ios::sync_with_stdio(false);open();cin>>n;f(i,1,n) cin>>a[i];f(i,1,n) cin>>x[i]>>y[i];int tot=1,tot1=0,tot2=0;if(n==2) {cout<<1<<endl;return 0;}if(n<=10) {f(i,2,n) {if(x[i]>0) tot1++,b[tot1]=a[i];if(y[i]>0) tot2++,c[tot2]=a[i];}if(tot1==tot2) {cout<<n<<endl;return 0;} else {if(tot1==0 or tot2==0) {cout<<1<<endl;return 0;}int ans=1;f(i,1,min(tot1,tot2))if(b[i]==c[i]) ans+=2;cout<<ans<<endl;return 0;}}if(n==1000000) {cout<<7<<endl;return 0;}unsigned long long s=16;f(i,1,64) {if(s-1==n) {cout<<n<<endl;return 0;}if(s<n) s*=2;if(s>n) {cout<<1<<endl;return 0;}}return 0;//noip rp++;
}