#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n,x,y,d[100010];
int li[100010],li2[100010];

int main(){
	cin >> n;
	REP(i,0,n) cin >> d[i];
	cin >> x >> y;
	int pos=abs(x)+abs(y);
	sort(d,d+n);
	REP(i,0,n) li[i+1]=li[i]+d[i]%2;
	REP(i,0,n) li2[i+1]=li2[i]+!(d[i]%2);
	REP(i,0,n) if(d[i]==pos){cout << 1 << endl; return 0;}
	REP(i,0,n){
		int c1=lower_bound(d,d+n,pos-d[i])-d;
		int c2=lower_bound(d,d+n,(pos-d[i])+(2*d[i]-1))-d;
		while(d[c2]>(pos-d[i])+(2*d[i]-1)) c2--;
	
		if((pos-d[i])%2 and li[c2]-li[c1]){cout << 2 << endl; return 0;}
		else if(!((pos-d[i])%2) and li2[c2]-li2[c1]){cout << 2 << endl; return 0;}
	}
	
	cout << -1 << endl;
	return 0;
}