#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
const ll INF = 1LL << 60;
const double pi = acos(-1);
ll mod = 1000000007;

int main() {
    int n; cin >> n;
    vector<ll> d(n);
    rep(i,n) {
        cin >> d[i];
    }
    sort(d.begin(),d.end());
    int x,y; cin >> x >> y;
    int sum = abs(x) + abs(y);
    int ans = 3;
    if(x != 0 || y != 0) {
        rep(i,n){
            int j = i + 1;
            if(d[i] == sum) ans = min(ans,1);
            while(d[i] + d[j] <= sum) {
                if(d[i] + d[j] == sum) {
                    ans = min(ans,2);
                }
                j++;
            }
        }
    }else{
        ans = 0;
    }
    if(ans == 3) ans = -1;
    cout << ans << endl;
    return 0;
}