#include<iostream>
using namespace std;
typedef long long ll;

int main(){
	ll n; cin >> n;
	ll x[n];
	ll sum = 0;
	ll dec[n - 1] = {0};
	ll cango[n];
	for(ll i = 0; i < n; ++i){
		cin >> x[i];
		sum += x[i];
	}
	for(ll i = 0; i < n - 1; ++i){
		dec[i] = x[i + 1] - x[i];
	}
	ll l, q; cin >> l >> q;
	ll flag = 0;
	ll subs = 0;
	while(1){
		if(subs + dec[flag] > l || flag == n - 1) break;
		subs += dec[flag];
		++flag;
	}
	cango[0] = flag;
	for(ll i = 1; i < n; ++i){
		if(flag == n - 2){
			for(ll j = i; j < n; ++j) cango[j] = n - 1;
			break;
		}
		subs -= dec[i - 1];
		while(1){
			if(subs + dec[flag] > l || flag == n - 1) break;
			subs += dec[flag];
			++flag;
		}
		cango[i] = flag;
	}

	/*for(ll que = 0; que < q; ++que){
		ll a, b; cin >> a >> b;
		--a; --b;
		if(a > b) a ^= b ^= a ^= b;
		ll now = a;
		ll ans = 0;
		while(now < b){
			now = cango[now];
			++ans;
		}
		cout << ans << endl;
	}*/
	return 0;
}