#include<iostream>

 #include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<map>

 #include<set>

 #include<vector>

 #include<algorithm>

 #include<stack>

 #include<queue>

 #include<cctype>

 #include<sstream>

 using namespace std;

 #define pii pair<int,int>

 #define LL long long int

 const int eps=1e-;

 const int INF=;

 const int maxn=+;

 const double pi=acos(-);

 const double ds=pi/;

 const double g=9.8;

 double l1,l2,r1,r2,h,v[];

 int ans,n;

 int gao(double t)

 {

     int res=;

     for(int i=;i<n;i++)

     {

         double vx=v[i]*cos(t);

         double vy=v[i]*sin(t);

         double vt=sqrt(*g*h+vy*vy);

         double t=(vt-vy)/g;

         double d=vx*t;

         if(d>=l2&&d<=r2) return ;

         else

         {

             if(d>=l1&&d<=r1)

             {

                 res++;

             }

         }

     }

     return res;

 }

 int main()

 {

     //freopen("in8.txt","r",stdin);

     while(scanf("%d",&n)==&&n)

     {

         scanf("%lf%lf%lf%lf%lf",&h,&l1,&r1,&l2,&r2);

         for(int i=;i<n;i++)

         {

             scanf("%lf",&v[i]);

         }

         ans=;

         for(double i=-(pi/);i<=(pi/);i+=ds)

         {

             ans=max(ans,gao(i));

         }

         printf("%d\n",ans);

     }

     return ;

 }