#include<bits/stdc++.h>
using namespace std;
int n,ans,l,r,t,h[100050];
int dfs(int x){
	if(x==n){
		ans++;
		return 0;
	}
	if(abs(h[x]-h[x+1])<=t){
		dfs(x+1);
	}
	if(x+2<=n){
		if(abs(h[x]-h[x+2])<=t){
			dfs(x+2);
		}
	}
	return 0;
}
int main(){
	freopen("cirnoisclever.in","r",stdin);
	freopen("cirnoisclever.out","w",stdout);
	cin>>n>>l>>r>>t;
	for(int i=1;i<=n;i++){
		cin>>h[i];
	}
	dfs(1);
	cout<<ans;
	return 0;
}