#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=1000000000000;/*10^12*/
#define rep(i,l,r) for(ll i=l;i<=r;i++)
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}


//////////////////////////////////////

int main(){

    int n;cin>>n;
    ll d[n];rep(i,0,n-1)cin>>d[i];
    ll x,y;cin>>x>>y;
    x=abs(x);y=abs(y);
    x=max(x,y);
    if(x==0){
        cout<<0<<endl;return 0;
    }
    sort(d,d+n);
    rep(i,0,n-1){
        if(x==d[i]){
            cout<<1<<endl;
            return 0;
        }
    }
    ll dmax=d[n-1];
    if(x<=dmax*2){
        cout<<2<<endl;
        return 0;
    }
    cout<<(x+dmax-1)/dmax<<endl;
    
    return 0;
}