#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };




int main() {
	int n;
	cin >> n;
	vector<ll>d(n);
	rep(i, 0, n)cin >> d[i];
	int x, y;
	cin >> x >> y;
	sort(all(d));
	reverse(all(d));
	ll dist = max(abs(x),abs(y));


	if (x == 0 && y == 0) {
		cout << 0 << endl;
	}
	else if (dist <= d[0]){
		int ok = 0;
		fore(x, d) {
			if (x == dist)ok = 1;
		}
		if (ok)cout << 1 << endl;
		else cout << 2 << endl;
	}
	else {
		cout << (dist + d[0] - 1) / d[0] << endl;
	}



	
	return 0;
}