#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    vector<ll> D(N);
    FOR(i, 0, N){
        cin >> D.at(i);
    }
    sort(ALL(D));

    ll x, y;
    cin >> x >> y;
    x = abs(x);
    y = abs(y);

    if(x==0 && y==0){
        p(0);
        return 0;
    }

    ll d_max = D.back();
    ll z = max(x, y);

    if(z<d_max){
        // 1回か2回でいける
        for(ll d : D){
            if(z==d){
                p(1);
                return 0;
            }
        }

        p(2);
        return 0;
    }

    ll num = z / d_max;
    ll rest = z % d_max;

    if(rest==0){
        p(num);
        return 0;
    }

    p(num+1);
    
    return 0;
}