#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef unsigned long long lld;
typedef pair<lld,int> PUI;
vector<PUI> env;
#define M 200010
int f[M];
lld A[M];
int Min[20][M];
int idx[M];
void initRMQ(int n) {
	idx[0] = -1;
	for(int i = 1; i <= n ; i ++) {
		idx[i] = (i&(i-1)) ? idx[i-1] : idx[i-1] + 1;
		Min[0][i] =  f[i];
	}
	for(int i = 1; i <= idx[n] ; i ++) {
		int limit = n + 1 - (1<<i);
		for(int j = 1; j <= limit ; j ++) {
			Min[i][j] = min(Min[i-1][j] , Min[i-1][j+(1<<i>>1)]);
		}
	}
}
int getval(int a,int b) {
	int t = idx[b-a+1];
	b -= (1<<t) - 1;
	return min(Min[t][a] , Min[t][b]);
}
lld vec[M];
lld L,R,ac,bc;
int N;

int main(){
    int i,j;
    while(scanf("%d",&N)!=EOF){
        env.clear();
        cin>>L>>R;
        cin>>ac>>bc;
        lld inv = ac-bc;
        for (i=0;i<N;i++){
            scanf("%llu",&vec[i]);
            lld tmp ;
            if (vec[i]+1<inv+L) tmp = L;
            else tmp = vec[i]-inv+1;
            env.push_back(PUI(tmp,1));
            env.push_back(PUI(vec[i]+1,-1));
        }
        sort(env.begin(),env.end());
        int tot = 0;
        int en = env.size(), ln=1;
        for (i=0;i<en;i = j){
            for (j=i;env[j].first==env[i].first;j++)
            {
                tot+=env[j].second;
            }
            if (env[i].first>R-inv+1) continue;
            f[ln] = tot;
            A[ln++] = env[i].first;
          // cout<<f[ln-1]<<" "<<A[ln-1]<<endl;
        }
        A[ln] = R-inv+2;
        ln--;
        initRMQ(ln);
        int ans = 0;
        for (i=j =1;i<=ln;i++){
            for (;j<=ln;j++){
                lld tmp;
                tmp = A[j+1];
                if ((i==j||(A[j]+1<bc+1+A[i+1]))
                    &&(tmp>=bc+1+A[i])){
                      //  printf("%d %d %d---\n",i,j,getval(i,j));
                        ans = max(ans,getval(i,j));
                    }
                else if (i!=j&&A[j]+1>=bc+1+A[i+1]) break;
            }
            j--;
        }
        printf("%d\n",ans);
    }
}