#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include<cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
#define MAIN_INIT std::cin.tie(0); \
    std::ios::sync_with_stdio(false);\
	std::cout << std::fixed;//小数を10進数表示
/////////
#ifdef getchar_unlocked
#define mygc(c) (c)=getchar_unlocked()
#else
#define mygc(c) (c)=getchar()
#endif
#ifdef putchar_unlocked
#define mypc(c) putchar_unlocked(c)
#else
#define mypc(c) putchar(c)
#endif
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
#ifdef _DEBUG
#define DEBUG_BOOL(b) assert(b)
#else
#define DEBUG_BOOL(b) 
#endif
/////数値読み込み
#define ENABLE_READER_ON(T)	\
inline void reader(T &x){int k;x = 0;bool flag = true;\
while(true){mygc(k);\
if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\
}\
if( flag ){while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 + (k - '0');}}\
else{while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 - (k-'0');}}\
}
//整数
ENABLE_READER_ON(int)
ENABLE_READER_ON(long)
ENABLE_READER_ON(long long)
ENABLE_READER_ON(unsigned int)
ENABLE_READER_ON(unsigned long)
ENABLE_READER_ON(unsigned long long)

//////
//文字読み込み
inline int reader(char& c){int i;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c = i;
return i;}

inline int reader(char c[]){int i,s=0;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c[s++]=i;
for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}
c[s]='\0';return s;
}

inline int reader(string& c,int size=100){int i;c.reserve(size);
for(;;){mygc(i);if(i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF)break;}
c.push_back(i);
for(;;){mygc(i);if(i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)break;c.push_back(i);}
return c.size();}

/////////
//数値出力
#define ENABLE_WRITER_ON(T)	\
inline void writer(T x){char f[20];int s = 0;\
if (x<0){mypc('-');while(x){f[s++] = ~(x%10)+1,x /= 10;}}\
else{while(x){f[s++] = (x % 10), x /= 10;}}\
if (!s)f[s++] = 0;while (s--)mypc(f[s] + '0');}

ENABLE_WRITER_ON(int)
ENABLE_WRITER_ON(long)
ENABLE_WRITER_ON(long long)
ENABLE_WRITER_ON(unsigned int)
ENABLE_WRITER_ON(unsigned long)
ENABLE_WRITER_ON(unsigned long long)
/////////
inline void writer(const char c){mypc(c);}
inline void writer(const char c[]){for (int i = 0; c[i] != '\0'; i++)mypc(c[i]); }
inline void writer(const string str){writer( str.c_str() );}
///////////////////////////////////////////////////////////
// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////

inline void solve(){
	int dSize,pos;
	reader(dSize);
	vector<LL> D(dSize);
	vector<pair<LL,LL>> prev,next;
	pair<LL,LL> temp,now;
	LL lenMax = 0;
	for(int i=0;i<dSize;++i){
		reader( D[i] );
		lenMax = max(lenMax, D[i] );
	}
	sort(D.begin(), D.end() );

	LL X,Y,XY;
	reader(X);reader(Y);
	X = abs(X);
	Y = abs(Y);
	XY = max(X,Y);

	//MAX
	LL turn = 1;
	int prevSize;
	if( XY == 0 ){
		writer( 0 );writer( '\n' );
		return;
	}else if( XY >= 2*lenMax ){
		turn = XY/lenMax;
		//[-turn*lenMax,turn*lenMax]
		temp.first = -turn*lenMax;
		temp.second = turn*lenMax;
		prev.push_back( temp );
	}else{
		for(int i=0;i<dSize;++i){
			temp.first = D[i];
			temp.second = D[i];
			prev.push_back( temp );
		}
		sort(prev.begin(), prev.end() );
		prevSize = prev.size();
		for(pos=0; pos<prevSize-1; ++pos ){
			if( prev[pos].second > prev[pos+1].first ){
				temp.first = prev[pos].first;
				temp.second = max( prev[pos].second, prev[pos+1].second );
				prev[pos+1] = temp;
			}else{
				next.push_back( prev[pos] );
			}
		}
		next.push_back( prev[pos] );
		prev = next;
		next.resize(0);
	}
	
	for(;;++turn){
		//終了チェック
		prevSize = prev.size();
		for(int i=0;i<prevSize;++i){
			if( prev[i].first <= XY && XY <= prev[i].second ){
					writer( turn );writer('\n');return;
			}
		}

		//次の範囲を作る
		for(int i=0;i<prevSize;++i){
			for(int d=0;d<dSize;++d){
				temp.first = prev[i].first - D[d];
				temp.second = prev[i].second + D[d];
				next.push_back( temp );
			}
		}
		prev = next;
		next.resize(0);

		//範囲重複チェック
		prevSize = prev.size();
		sort( prev.begin(), prev.end() );
		for(pos=0;pos<prevSize-1;++pos){
			if( prev[pos].second >= prev[pos+1].first ){
				temp.first = prev[pos].first;
				temp.second = max( prev[pos].second , prev[pos+1].second );
				prev[pos+1] = temp;
			}else{
				next.push_back( prev[pos] );
			}
		}
		next.push_back( prev[pos] );
		prev = next;
		next.resize(0);
	}
}

int main(void){
    MAIN_INIT;
    cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();

	return 0;
}