#include <bits/stdc++.h>

#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 64;

constexpr ll dir[5] = {1, 0, -1, 0, 1};
int main()
{
    int N;
    cin >> N;
    vector<ll> d(N);
    for (int i = 0; i < N; i++) {
        cin >> d[i];
    }
    ll x, y;
    cin >> x >> y;
    const ll dist = abs(x) + abs(y);
    if (dist == 0) {
        cout << 0 << endl;
    }
    for (int i = 0; i < N; i++) {
        if (dist == d[i]) {
            cout << 1 << endl;
            return 0;
        }
    }
    sort(d.begin(), d.end());
    for (int i = 0; i < N; i++) {
        if (dist >= d[i]) {
            const ll resp = dist - d[i];
            if (upper_bound(d.begin(), d.end(), resp) - lower_bound(d.begin(), d.end(), resp) > 0) {
                cout << 2 << endl;
                return 0;
            }
            const ll resm = dist + d[i];
            if (upper_bound(d.begin(), d.end(), resm) - lower_bound(d.begin(), d.end(), resm) > 0) {
                cout << 2 << endl;
                return 0;
            }
        }
    }
    cout << -1 << endl;
    return 0;
}